TSTP Solution File: SEV120^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV120^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:48 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 36 ( 10 unt; 12 typ; 0 def)
% Number of atoms : 63 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 317 ( 26 ~; 39 |; 22 &; 216 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 57 ( 57 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 49 ( 0 ^ 49 !; 0 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: ( a > a > $o ) > $o ).
thf(decl_23,type,
esk1_0: a ).
thf(decl_24,type,
esk2_0: a ).
thf(decl_25,type,
esk3_0: a ).
thf(decl_26,type,
esk4_1: ( a > a > $o ) > a ).
thf(decl_27,type,
esk5_1: ( a > a > $o ) > a ).
thf(decl_28,type,
esk6_1: ( a > a > $o ) > a ).
thf(decl_29,type,
esk7_1: ( a > a > $o ) > a ).
thf(decl_30,type,
esk8_1: ( a > a > $o ) > a ).
thf(decl_31,type,
esk9_1: ( a > a > $o ) > a ).
thf(decl_32,type,
epred2_0: a > a > $o ).
thf(cTHM70_pme,conjecture,
! [X1: ( a > a > $o ) > $o,X2: a,X3: a,X4: a] :
( ( ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) )
& ( X1 @ X5 ) )
=> ( X5 @ X2 @ X3 ) )
& ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) )
& ( X1 @ X5 ) )
=> ( X5 @ X3 @ X4 ) ) )
=> ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) )
& ( X1 @ X5 ) )
=> ( X5 @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM70_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( a > a > $o ) > $o,X2: a,X3: a,X4: a] :
( ( ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) )
& ( X1 @ X5 ) )
=> ( X5 @ X2 @ X3 ) )
& ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) )
& ( X1 @ X5 ) )
=> ( X5 @ X3 @ X4 ) ) )
=> ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) )
& ( X1 @ X5 ) )
=> ( X5 @ X2 @ X4 ) ) ),
inference(assume_negation,[status(cth)],[cTHM70_pme]) ).
thf(c_0_2,negated_conjecture,
! [X29: a > a > $o,X33: a > a > $o,X38: a,X39: a,X40: a] :
( ( ( X29 @ ( esk4_1 @ X29 ) @ ( esk5_1 @ X29 ) )
| ~ ( epred1_0 @ X29 )
| ( X29 @ esk1_0 @ esk2_0 ) )
& ( ( X29 @ ( esk5_1 @ X29 ) @ ( esk6_1 @ X29 ) )
| ~ ( epred1_0 @ X29 )
| ( X29 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X29 @ ( esk4_1 @ X29 ) @ ( esk6_1 @ X29 ) )
| ~ ( epred1_0 @ X29 )
| ( X29 @ esk1_0 @ esk2_0 ) )
& ( ( X33 @ ( esk7_1 @ X33 ) @ ( esk8_1 @ X33 ) )
| ~ ( epred1_0 @ X33 )
| ( X33 @ esk2_0 @ esk3_0 ) )
& ( ( X33 @ ( esk8_1 @ X33 ) @ ( esk9_1 @ X33 ) )
| ~ ( epred1_0 @ X33 )
| ( X33 @ esk2_0 @ esk3_0 ) )
& ( ~ ( X33 @ ( esk7_1 @ X33 ) @ ( esk9_1 @ X33 ) )
| ~ ( epred1_0 @ X33 )
| ( X33 @ esk2_0 @ esk3_0 ) )
& ( ~ ( epred2_0 @ X38 @ X39 )
| ~ ( epred2_0 @ X39 @ X40 )
| ( epred2_0 @ X38 @ X40 ) )
& ( epred1_0 @ epred2_0 )
& ~ ( epred2_0 @ esk1_0 @ esk3_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: a > a > $o] :
( ( X5 @ ( esk8_1 @ X5 ) @ ( esk9_1 @ X5 ) )
| ( X5 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
epred1_0 @ epred2_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X2: a,X3: a,X4: a] :
( ( epred2_0 @ X2 @ X4 )
| ~ ( epred2_0 @ X2 @ X3 )
| ~ ( epred2_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( epred2_0 @ ( esk8_1 @ epred2_0 ) @ ( esk9_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X5: a > a > $o] :
( ( X5 @ ( esk7_1 @ X5 ) @ ( esk8_1 @ X5 ) )
| ( X5 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X5: a > a > $o] :
( ( X5 @ ( esk5_1 @ X5 ) @ ( esk6_1 @ X5 ) )
| ( X5 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X2: a] :
( ( epred2_0 @ X2 @ ( esk9_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 )
| ~ ( epred2_0 @ X2 @ ( esk8_1 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_10,negated_conjecture,
( ( epred2_0 @ ( esk7_1 @ epred2_0 ) @ ( esk8_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
thf(c_0_11,negated_conjecture,
( ( epred2_0 @ ( esk5_1 @ epred2_0 ) @ ( esk6_1 @ epred2_0 ) )
| ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
thf(c_0_12,negated_conjecture,
! [X5: a > a > $o] :
( ( X5 @ ( esk4_1 @ X5 ) @ ( esk5_1 @ X5 ) )
| ( X5 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
! [X5: a > a > $o] :
( ( X5 @ esk2_0 @ esk3_0 )
| ~ ( X5 @ ( esk7_1 @ X5 ) @ ( esk9_1 @ X5 ) )
| ~ ( epred1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
( ( epred2_0 @ ( esk7_1 @ epred2_0 ) @ ( esk9_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_15,negated_conjecture,
! [X2: a] :
( ( epred2_0 @ X2 @ ( esk6_1 @ epred2_0 ) )
| ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ X2 @ ( esk5_1 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
thf(c_0_16,negated_conjecture,
( ( epred2_0 @ ( esk4_1 @ epred2_0 ) @ ( esk5_1 @ epred2_0 ) )
| ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_4]) ).
thf(c_0_17,negated_conjecture,
epred2_0 @ esk2_0 @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_4])]) ).
thf(c_0_18,negated_conjecture,
! [X5: a > a > $o] :
( ( X5 @ esk1_0 @ esk2_0 )
| ~ ( X5 @ ( esk4_1 @ X5 ) @ ( esk6_1 @ X5 ) )
| ~ ( epred1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_19,negated_conjecture,
( ( epred2_0 @ ( esk4_1 @ epred2_0 ) @ ( esk6_1 @ epred2_0 ) )
| ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_20,negated_conjecture,
~ ( epred2_0 @ esk1_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_21,negated_conjecture,
! [X2: a] :
( ( epred2_0 @ X2 @ esk3_0 )
| ~ ( epred2_0 @ X2 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_17]) ).
thf(c_0_22,negated_conjecture,
epred2_0 @ esk1_0 @ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_4])]) ).
thf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEV120^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n026.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.29 % CPULimit : 300
% 0.14/0.29 % WCLimit : 300
% 0.14/0.29 % DateTime : Sun May 19 18:49:37 EDT 2024
% 0.14/0.29 % CPUTime :
% 0.14/0.39 Running higher-order theorem proving
% 0.14/0.39 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.14/0.40 # Version: 3.1.0-ho
% 0.14/0.40 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.14/0.40 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting sh2lt with 1200s (4) cores
% 0.14/0.40 # Starting new_ho_10_unif with 300s (1) cores
% 0.14/0.40 # Starting full_lambda_6 with 300s (1) cores
% 0.14/0.40 # Starting post_as_ho1 with 300s (1) cores
% 0.14/0.40 # Starting ehoh_best3_rw with 300s (1) cores
% 0.14/0.40 # full_lambda_6 with pid 17627 completed with status 0
% 0.14/0.40 # Result found by full_lambda_6
% 0.14/0.40 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.14/0.40 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting sh2lt with 1200s (4) cores
% 0.14/0.40 # Starting new_ho_10_unif with 300s (1) cores
% 0.14/0.40 # Starting full_lambda_6 with 300s (1) cores
% 0.14/0.40 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.14/0.40 # Search class: HGUNF-FFSF11-SHHFFMBN
% 0.14/0.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting ho_unfolding_3 with 163s (1) cores
% 0.14/0.40 # ho_unfolding_3 with pid 17631 completed with status 0
% 0.14/0.40 # Result found by ho_unfolding_3
% 0.14/0.40 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.14/0.40 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting sh2lt with 1200s (4) cores
% 0.14/0.40 # Starting new_ho_10_unif with 300s (1) cores
% 0.14/0.40 # Starting full_lambda_6 with 300s (1) cores
% 0.14/0.40 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.14/0.40 # Search class: HGUNF-FFSF11-SHHFFMBN
% 0.14/0.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting ho_unfolding_3 with 163s (1) cores
% 0.14/0.40 # Preprocessing time : 0.001 s
% 0.14/0.40 # Presaturation interreduction done
% 0.14/0.40
% 0.14/0.40 # Proof found!
% 0.14/0.40 # SZS status Theorem
% 0.14/0.40 # SZS output start CNFRefutation
% See solution above
% 0.14/0.40 # Parsed axioms : 2
% 0.14/0.40 # Removed by relevancy pruning/SinE : 1
% 0.14/0.40 # Initial clauses : 9
% 0.14/0.40 # Removed in clause preprocessing : 0
% 0.14/0.40 # Initial clauses in saturation : 9
% 0.14/0.40 # Processed clauses : 36
% 0.14/0.40 # ...of these trivial : 0
% 0.14/0.40 # ...subsumed : 0
% 0.14/0.40 # ...remaining for further processing : 36
% 0.14/0.40 # Other redundant clauses eliminated : 0
% 0.14/0.40 # Clauses deleted for lack of memory : 0
% 0.14/0.40 # Backward-subsumed : 0
% 0.14/0.40 # Backward-rewritten : 10
% 0.14/0.40 # Generated clauses : 32
% 0.14/0.40 # ...of the previous two non-redundant : 26
% 0.14/0.40 # ...aggressively subsumed : 0
% 0.14/0.40 # Contextual simplify-reflections : 0
% 0.14/0.40 # Paramodulations : 22
% 0.14/0.40 # Factorizations : 0
% 0.14/0.40 # NegExts : 0
% 0.14/0.40 # Equation resolutions : 0
% 0.14/0.40 # Disequality decompositions : 0
% 0.14/0.40 # Total rewrite steps : 13
% 0.14/0.40 # ...of those cached : 10
% 0.14/0.40 # Propositional unsat checks : 0
% 0.14/0.40 # Propositional check models : 0
% 0.14/0.40 # Propositional check unsatisfiable : 0
% 0.14/0.40 # Propositional clauses : 0
% 0.14/0.40 # Propositional clauses after purity: 0
% 0.14/0.40 # Propositional unsat core size : 0
% 0.14/0.40 # Propositional preprocessing time : 0.000
% 0.14/0.40 # Propositional encoding time : 0.000
% 0.14/0.40 # Propositional solver time : 0.000
% 0.14/0.40 # Success case prop preproc time : 0.000
% 0.14/0.40 # Success case prop encoding time : 0.000
% 0.14/0.40 # Success case prop solver time : 0.000
% 0.14/0.40 # Current number of processed clauses : 17
% 0.14/0.40 # Positive orientable unit clauses : 3
% 0.14/0.40 # Positive unorientable unit clauses: 0
% 0.14/0.40 # Negative unit clauses : 1
% 0.14/0.40 # Non-unit-clauses : 13
% 0.14/0.40 # Current number of unprocessed clauses: 7
% 0.14/0.40 # ...number of literals in the above : 19
% 0.14/0.40 # Current number of archived formulas : 0
% 0.14/0.40 # Current number of archived clauses : 19
% 0.14/0.40 # Clause-clause subsumption calls (NU) : 27
% 0.14/0.40 # Rec. Clause-clause subsumption calls : 23
% 0.14/0.40 # Non-unit clause-clause subsumptions : 0
% 0.14/0.40 # Unit Clause-clause subsumption calls : 0
% 0.14/0.40 # Rewrite failures with RHS unbound : 0
% 0.14/0.40 # BW rewrite match attempts : 2
% 0.14/0.40 # BW rewrite match successes : 2
% 0.14/0.40 # Condensation attempts : 36
% 0.14/0.40 # Condensation successes : 0
% 0.14/0.40 # Termbank termtop insertions : 1912
% 0.14/0.40 # Search garbage collected termcells : 348
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.006 s
% 0.14/0.40 # System time : 0.000 s
% 0.14/0.40 # Total time : 0.006 s
% 0.14/0.40 # Maximum resident set size: 1728 pages
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.006 s
% 0.14/0.40 # System time : 0.003 s
% 0.14/0.40 # Total time : 0.009 s
% 0.14/0.40 # Maximum resident set size: 1724 pages
% 0.14/0.40 % E---3.1 exiting
% 0.14/0.40 % E exiting
%------------------------------------------------------------------------------