TSTP Solution File: SEV034^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV034^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:26 EDT 2024
% Result : Theorem 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 75 ( 8 equ; 0 cnn)
% Maximal formula atoms : 21 ( 2 avg)
% Number of connectives : 378 ( 33 ~; 29 |; 21 &; 270 @)
% ( 1 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 8 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 89 ( 0 ^ 89 !; 0 ?; 89 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
b: $tType ).
thf(decl_22,type,
epred1_0: a > a > $o ).
thf(decl_23,type,
epred2_0: a > b > b > $o ).
thf(decl_24,type,
esk1_0: a > b ).
thf(decl_25,type,
esk2_0: a > b ).
thf(decl_26,type,
esk3_0: a ).
thf(decl_27,type,
esk4_0: a ).
thf(cTHM518_pme,conjecture,
! [X1: a > a > $o,X2: a > b > b > $o,X3: a > b,X4: a > b] :
( ! [X5: a] :
( ( X1 @ X5 @ X5 )
=> ( X2 @ X5 @ ( X3 @ X5 ) @ ( X4 @ X5 ) ) )
=> ( ! [X5: a,X6: a] :
( ( X1 @ X5 @ X6 )
=> ( X2 @ X5 @ ( X3 @ X5 ) @ ( X3 @ X6 ) ) )
=> ( ( ! [X5: a,X6: a] :
( ( X1 @ X5 @ X6 )
=> ( X1 @ X6 @ X5 ) )
& ! [X5: a,X6: a,X7: a] :
( ( ( X1 @ X5 @ X6 )
& ( X1 @ X6 @ X7 ) )
=> ( X1 @ X5 @ X7 ) )
& ( X1 = X1 ) )
=> ( ! [X5: a,X6: a] :
( ( X1 @ X5 @ X6 )
=> ( ! [X8: b,X9: b] :
( ( X2 @ X5 @ X8 @ X9 )
=> ( X2 @ X5 @ X9 @ X8 ) )
& ! [X8: b,X9: b,X10: b] :
( ( ( X2 @ X5 @ X8 @ X9 )
& ( X2 @ X5 @ X9 @ X10 ) )
=> ( X2 @ X5 @ X8 @ X10 ) )
& ( ( X2 @ X5 )
= ( X2 @ X6 ) ) ) )
=> ! [X5: a,X6: a] :
( ( X1 @ X5 @ X6 )
=> ( X2 @ X5 @ ( X3 @ X5 ) @ ( X4 @ X6 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM518_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > $o,X2: a > b > b > $o,X3: a > b,X4: a > b] :
( ! [X5: a] :
( ( X1 @ X5 @ X5 )
=> ( X2 @ X5 @ ( X3 @ X5 ) @ ( X4 @ X5 ) ) )
=> ( ! [X5: a,X6: a] :
( ( X1 @ X5 @ X6 )
=> ( X2 @ X5 @ ( X3 @ X5 ) @ ( X3 @ X6 ) ) )
=> ( ( ! [X5: a,X6: a] :
( ( X1 @ X5 @ X6 )
=> ( X1 @ X6 @ X5 ) )
& ! [X5: a,X6: a,X7: a] :
( ( ( X1 @ X5 @ X6 )
& ( X1 @ X6 @ X7 ) )
=> ( X1 @ X5 @ X7 ) )
& ( X1 = X1 ) )
=> ( ! [X5: a,X6: a] :
( ( X1 @ X5 @ X6 )
=> ( ! [X8: b,X9: b] :
( ( X2 @ X5 @ X8 @ X9 )
=> ( X2 @ X5 @ X9 @ X8 ) )
& ! [X8: b,X9: b,X10: b] :
( ( ( X2 @ X5 @ X8 @ X9 )
& ( X2 @ X5 @ X9 @ X10 ) )
=> ( X2 @ X5 @ X8 @ X10 ) )
& ( ( X2 @ X5 )
= ( X2 @ X6 ) ) ) )
=> ! [X5: a,X6: a] :
( ( X1 @ X5 @ X6 )
=> ( X2 @ X5 @ ( X3 @ X5 ) @ ( X4 @ X6 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM518_pme]) ).
thf(c_0_2,negated_conjecture,
! [X36: a,X37: a,X38: a,X39: a,X40: a,X41: a,X42: a,X43: a,X44: a,X45: a,X46: b,X47: b,X48: b,X49: b,X50: b] :
( ( ~ ( epred1_0 @ X36 @ X36 )
| ( epred2_0 @ X36 @ ( esk1_0 @ X36 ) @ ( esk2_0 @ X36 ) ) )
& ( ~ ( epred1_0 @ X37 @ X38 )
| ( epred2_0 @ X37 @ ( esk1_0 @ X37 ) @ ( esk1_0 @ X38 ) ) )
& ( ~ ( epred1_0 @ X39 @ X40 )
| ( epred1_0 @ X40 @ X39 ) )
& ( ~ ( epred1_0 @ X41 @ X42 )
| ~ ( epred1_0 @ X42 @ X43 )
| ( epred1_0 @ X41 @ X43 ) )
& ( epred1_0 = epred1_0 )
& ( ~ ( epred2_0 @ X44 @ X46 @ X47 )
| ( epred2_0 @ X44 @ X47 @ X46 )
| ~ ( epred1_0 @ X44 @ X45 ) )
& ( ~ ( epred2_0 @ X44 @ X48 @ X49 )
| ~ ( epred2_0 @ X44 @ X49 @ X50 )
| ( epred2_0 @ X44 @ X48 @ X50 )
| ~ ( epred1_0 @ X44 @ X45 ) )
& ( ( ( epred2_0 @ X44 )
= ( epred2_0 @ X45 ) )
| ~ ( epred1_0 @ X44 @ X45 ) )
& ( epred1_0 @ esk3_0 @ esk4_0 )
& ~ ( epred2_0 @ esk3_0 @ ( esk1_0 @ esk3_0 ) @ ( esk2_0 @ esk4_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,X6: a] :
( ( epred1_0 @ X6 @ X5 )
| ~ ( epred1_0 @ X5 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
epred1_0 @ esk3_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X5: a,X6: a] :
( ( ( epred2_0 @ X5 )
= ( epred2_0 @ X6 ) )
| ~ ( epred1_0 @ X5 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
epred1_0 @ esk4_0 @ esk3_0,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X5: a,X6: a,X7: a] :
( ( epred1_0 @ X5 @ X7 )
| ~ ( epred1_0 @ X5 @ X6 )
| ~ ( epred1_0 @ X6 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( ( epred2_0 @ esk4_0 )
= ( epred2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X5: a] :
( ( epred1_0 @ X5 @ esk4_0 )
| ~ ( epred1_0 @ X5 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
thf(c_0_10,negated_conjecture,
! [X5: a,X9: b,X8: b,X6: a] :
( ( epred2_0 @ X5 @ X9 @ X8 )
| ~ ( epred2_0 @ X5 @ X8 @ X9 )
| ~ ( epred1_0 @ X5 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X5: a,X6: a] :
( ( epred2_0 @ X5 @ ( esk1_0 @ X5 ) @ ( esk1_0 @ X6 ) )
| ~ ( epred1_0 @ X5 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X60: b,X61: b] :
( ( epred2_0 @ esk4_0 @ X60 @ X61 )
<=> ( epred2_0 @ esk3_0 @ X60 @ X61 ) ),
inference(arg_cong,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
! [X5: a] :
( ( epred2_0 @ X5 @ ( esk1_0 @ X5 ) @ ( esk2_0 @ X5 ) )
| ~ ( epred1_0 @ X5 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
! [X5: a] :
( ( epred1_0 @ esk4_0 @ X5 )
| ~ ( epred1_0 @ X5 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
thf(c_0_15,negated_conjecture,
! [X5: a,X10: b,X9: b,X8: b,X6: a] :
( ( epred2_0 @ X5 @ X8 @ X10 )
| ~ ( epred2_0 @ X5 @ X8 @ X9 )
| ~ ( epred2_0 @ X5 @ X9 @ X10 )
| ~ ( epred1_0 @ X5 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_16,negated_conjecture,
! [X5: a,X6: a] :
( ( epred2_0 @ X5 @ ( esk1_0 @ X6 ) @ ( esk1_0 @ X5 ) )
| ~ ( epred1_0 @ X5 @ X6 ) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11])]) ).
thf(c_0_17,negated_conjecture,
! [X8: b,X9: b] :
( ( epred2_0 @ esk3_0 @ X8 @ X9 )
| ~ ( epred2_0 @ esk4_0 @ X8 @ X9 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_18,negated_conjecture,
! [X5: a] :
( ( epred2_0 @ X5 @ ( esk2_0 @ X5 ) @ ( esk1_0 @ X5 ) )
| ~ ( epred1_0 @ X5 @ X5 ) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13])]) ).
thf(c_0_19,negated_conjecture,
epred1_0 @ esk4_0 @ esk4_0,
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
thf(c_0_20,negated_conjecture,
! [X5: a,X8: b,X6: a] :
( ( epred2_0 @ X5 @ X8 @ ( esk1_0 @ X5 ) )
| ~ ( epred2_0 @ X5 @ X8 @ ( esk1_0 @ X6 ) )
| ~ ( epred1_0 @ X5 @ X6 ) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16])]) ).
thf(c_0_21,negated_conjecture,
epred2_0 @ esk3_0 @ ( esk2_0 @ esk4_0 ) @ ( esk1_0 @ esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
thf(c_0_22,negated_conjecture,
epred2_0 @ esk3_0 @ ( esk2_0 @ esk4_0 ) @ ( esk1_0 @ esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_4])]) ).
thf(c_0_23,negated_conjecture,
~ ( epred2_0 @ esk3_0 @ ( esk1_0 @ esk3_0 ) @ ( esk2_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_24,negated_conjecture,
! [X5: a] :
~ ( epred1_0 @ esk3_0 @ X5 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_22]),c_0_23]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_4,c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.13 % Problem : SEV034^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 18:37:38 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.22/0.48 Running higher-order theorem proving
% 0.22/0.48 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.22/0.50 # Version: 3.1.0-ho
% 0.22/0.50 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting post_as_ho1 with 1500s (5) cores
% 0.22/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.50 # Starting new_ho_3 with 300s (1) cores
% 0.22/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.50 # post_as_ho12 with pid 29060 completed with status 0
% 0.22/0.50 # Result found by post_as_ho12
% 0.22/0.50 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting post_as_ho1 with 1500s (5) cores
% 0.22/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.50 # No SInE strategy applied
% 0.22/0.50 # Search class: HHUSF-FFSF00-SSSFFFNN
% 0.22/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.50 # new_ho_10 with pid 29064 completed with status 0
% 0.22/0.50 # Result found by new_ho_10
% 0.22/0.50 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting post_as_ho1 with 1500s (5) cores
% 0.22/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.50 # No SInE strategy applied
% 0.22/0.50 # Search class: HHUSF-FFSF00-SSSFFFNN
% 0.22/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Theorem
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 3
% 0.22/0.50 # Removed by relevancy pruning/SinE : 0
% 0.22/0.50 # Initial clauses : 12
% 0.22/0.50 # Removed in clause preprocessing : 3
% 0.22/0.50 # Initial clauses in saturation : 9
% 0.22/0.50 # Processed clauses : 71
% 0.22/0.50 # ...of these trivial : 3
% 0.22/0.50 # ...subsumed : 10
% 0.22/0.50 # ...remaining for further processing : 58
% 0.22/0.50 # Other redundant clauses eliminated : 0
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 0
% 0.22/0.50 # Backward-rewritten : 0
% 0.22/0.50 # Generated clauses : 188
% 0.22/0.50 # ...of the previous two non-redundant : 168
% 0.22/0.50 # ...aggressively subsumed : 0
% 0.22/0.50 # Contextual simplify-reflections : 0
% 0.22/0.50 # Paramodulations : 170
% 0.22/0.50 # Factorizations : 0
% 0.22/0.50 # NegExts : 0
% 0.22/0.50 # Equation resolutions : 0
% 0.22/0.50 # Disequality decompositions : 0
% 0.22/0.50 # Total rewrite steps : 27
% 0.22/0.50 # ...of those cached : 17
% 0.22/0.50 # Propositional unsat checks : 0
% 0.22/0.50 # Propositional check models : 0
% 0.22/0.50 # Propositional check unsatisfiable : 0
% 0.22/0.50 # Propositional clauses : 0
% 0.22/0.50 # Propositional clauses after purity: 0
% 0.22/0.50 # Propositional unsat core size : 0
% 0.22/0.50 # Propositional preprocessing time : 0.000
% 0.22/0.50 # Propositional encoding time : 0.000
% 0.22/0.50 # Propositional solver time : 0.000
% 0.22/0.50 # Success case prop preproc time : 0.000
% 0.22/0.50 # Success case prop encoding time : 0.000
% 0.22/0.50 # Success case prop solver time : 0.000
% 0.22/0.50 # Current number of processed clauses : 43
% 0.22/0.50 # Positive orientable unit clauses : 8
% 0.22/0.50 # Positive unorientable unit clauses: 0
% 0.22/0.50 # Negative unit clauses : 2
% 0.22/0.50 # Non-unit-clauses : 33
% 0.22/0.50 # Current number of unprocessed clauses: 115
% 0.22/0.50 # ...number of literals in the above : 377
% 0.22/0.50 # Current number of archived formulas : 0
% 0.22/0.50 # Current number of archived clauses : 15
% 0.22/0.50 # Clause-clause subsumption calls (NU) : 251
% 0.22/0.50 # Rec. Clause-clause subsumption calls : 247
% 0.22/0.50 # Non-unit clause-clause subsumptions : 18
% 0.22/0.50 # Unit Clause-clause subsumption calls : 4
% 0.22/0.50 # Rewrite failures with RHS unbound : 0
% 0.22/0.50 # BW rewrite match attempts : 2
% 0.22/0.50 # BW rewrite match successes : 0
% 0.22/0.50 # Condensation attempts : 71
% 0.22/0.50 # Condensation successes : 8
% 0.22/0.50 # Termbank termtop insertions : 4010
% 0.22/0.50 # Search garbage collected termcells : 569
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.005 s
% 0.22/0.50 # System time : 0.002 s
% 0.22/0.50 # Total time : 0.007 s
% 0.22/0.50 # Maximum resident set size: 1872 pages
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.008 s
% 0.22/0.50 # System time : 0.002 s
% 0.22/0.50 # Total time : 0.010 s
% 0.22/0.50 # Maximum resident set size: 1732 pages
% 0.22/0.50 % E---3.1 exiting
% 0.22/0.50 % E exiting
%------------------------------------------------------------------------------