TSTP Solution File: SEV185^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV185^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:07:56 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 21 ( 2 unt; 7 typ; 0 def)
% Number of atoms : 35 ( 0 equ; 0 cnn)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 158 ( 21 ~; 21 |; 9 &; 91 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 42 ( 42 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 39 ( 0 ^ 39 !; 0 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_22,type,
epred1_0: ( b > $o ) > b > $o ).
thf(decl_23,type,
epred2_0: ( b > $o ) > $o ).
thf(decl_24,type,
esk1_3: ( b > $o ) > ( b > $o ) > b > b ).
thf(decl_25,type,
epred3_0: b > $o ).
thf(decl_26,type,
esk2_0: b ).
thf(decl_27,type,
epred4_0: b > $o ).
thf(cTHM564_pme,conjecture,
! [X1: ( b > $o ) > b > $o,X2: ( b > $o ) > $o] :
( ! [X3: b > $o] :
( ( X2 @ X3 )
=> ! [X4: b > $o,X5: b] :
( ( ! [X6: b] :
( ( X4 @ X6 )
=> ( X3 @ X6 ) )
& ( X1 @ X4 @ X5 ) )
=> ( X3 @ X5 ) ) )
=> ! [X4: b > $o,X5: b] :
( ( ! [X7: b] :
( ( X4 @ X7 )
=> ! [X8: b > $o] :
( ( X2 @ X8 )
=> ( X8 @ X7 ) ) )
& ( X1 @ X4 @ X5 ) )
=> ! [X8: b > $o] :
( ( X2 @ X8 )
=> ( X8 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM564_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( b > $o ) > b > $o,X2: ( b > $o ) > $o] :
( ! [X3: b > $o] :
( ( X2 @ X3 )
=> ! [X4: b > $o,X5: b] :
( ( ! [X6: b] :
( ( X4 @ X6 )
=> ( X3 @ X6 ) )
& ( X1 @ X4 @ X5 ) )
=> ( X3 @ X5 ) ) )
=> ! [X4: b > $o,X5: b] :
( ( ! [X7: b] :
( ( X4 @ X7 )
=> ! [X8: b > $o] :
( ( X2 @ X8 )
=> ( X8 @ X7 ) ) )
& ( X1 @ X4 @ X5 ) )
=> ! [X8: b > $o] :
( ( X2 @ X8 )
=> ( X8 @ X5 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM564_pme]) ).
thf(c_0_2,negated_conjecture,
! [X22: b > $o,X23: b > $o,X24: b,X28: b,X29: b > $o] :
( ( ( X23 @ ( esk1_3 @ X22 @ X23 @ X24 ) )
| ~ ( epred1_0 @ X23 @ X24 )
| ( X22 @ X24 )
| ~ ( epred2_0 @ X22 ) )
& ( ~ ( X22 @ ( esk1_3 @ X22 @ X23 @ X24 ) )
| ~ ( epred1_0 @ X23 @ X24 )
| ( X22 @ X24 )
| ~ ( epred2_0 @ X22 ) )
& ( ~ ( epred3_0 @ X28 )
| ~ ( epred2_0 @ X29 )
| ( X29 @ X28 ) )
& ( epred1_0 @ epred3_0 @ esk2_0 )
& ( epred2_0 @ epred4_0 )
& ~ ( epred4_0 @ esk2_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X5: b,X3: b > $o] :
( ( X3 @ X5 )
| ~ ( epred3_0 @ X5 )
| ~ ( epred2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
epred2_0 @ epred4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X3: b > $o,X5: b,X4: b > $o] :
( ( X3 @ ( esk1_3 @ X4 @ X3 @ X5 ) )
| ( X4 @ X5 )
| ~ ( epred1_0 @ X3 @ X5 )
| ~ ( epred2_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
epred1_0 @ epred3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X5: b,X4: b > $o,X3: b > $o] :
( ( X3 @ X5 )
| ~ ( X3 @ ( esk1_3 @ X3 @ X4 @ X5 ) )
| ~ ( epred1_0 @ X4 @ X5 )
| ~ ( epred2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X5: b] :
( ( epred4_0 @ X5 )
| ~ ( epred3_0 @ X5 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_9,negated_conjecture,
! [X3: b > $o] :
( ( epred3_0 @ ( esk1_3 @ X3 @ epred3_0 @ esk2_0 ) )
| ( X3 @ esk2_0 )
| ~ ( epred2_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_10,negated_conjecture,
~ ( epred4_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X3: b > $o,X5: b] :
( ( epred4_0 @ X5 )
| ~ ( epred3_0 @ ( esk1_3 @ epred4_0 @ X3 @ X5 ) )
| ~ ( epred1_0 @ X3 @ X5 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_4])]) ).
thf(c_0_12,negated_conjecture,
epred3_0 @ ( esk1_3 @ epred4_0 @ epred3_0 @ esk2_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_4]),c_0_10]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_6])]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV185^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 18:54:07 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2lt with 1200s (4) cores
% 0.20/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best3_rw with 300s (1) cores
% 0.20/0.49 # new_ho_10_unif with pid 13749 completed with status 0
% 0.20/0.49 # Result found by new_ho_10_unif
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2lt with 1200s (4) cores
% 0.20/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGUNF-FFSF33-SHHFFMBN
% 0.20/0.49 # partial match(1): HGUNF-FFSF32-SHHFFMBN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 163s (1) cores
% 0.20/0.49 # ho_unfolding_3 with pid 13753 completed with status 0
% 0.20/0.49 # Result found by ho_unfolding_3
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2lt with 1200s (4) cores
% 0.20/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGUNF-FFSF33-SHHFFMBN
% 0.20/0.49 # partial match(1): HGUNF-FFSF32-SHHFFMBN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 163s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 2
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 7
% 0.20/0.49 # Removed in clause preprocessing : 1
% 0.20/0.49 # Initial clauses in saturation : 6
% 0.20/0.49 # Processed clauses : 18
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 18
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 10
% 0.20/0.49 # ...of the previous two non-redundant : 7
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 7
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 2
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 12
% 0.20/0.49 # Positive orientable unit clauses : 3
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 7
% 0.20/0.49 # Current number of unprocessed clauses: 1
% 0.20/0.49 # ...number of literals in the above : 3
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 6
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 6
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 3
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 18
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1081
% 0.20/0.49 # Search garbage collected termcells : 305
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.002 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1692 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1728 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------