TSTP Solution File: SEV059^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV059^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:30 EDT 2024
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 18 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 30 ( 5 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 118 ( 9 ~; 6 |; 9 &; 90 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 4 ^ 23 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_22,type,
cG: b > b ).
thf(decl_23,type,
cA: b > a ).
thf(decl_24,type,
c_less_: a > a > $o ).
thf(decl_25,type,
cF: b > b ).
thf(decl_26,type,
esk1_0: b ).
thf(cTHM89A_pme,conjecture,
( ( ! [X1: a,X2: a,X3: a] :
( ( ( c_less_ @ X1 @ X2 )
& ( c_less_ @ X2 @ X3 ) )
=> ( c_less_ @ X1 @ X3 ) )
& ! [X4: b] : ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cF @ X4 ) ) )
& ( cG
= ( ^ [X5: b] : ( cF @ ( cF @ X5 ) ) ) ) )
=> ! [X6: b] : ( c_less_ @ ( cA @ X6 ) @ ( cA @ ( cG @ X6 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM89A_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: a,X2: a,X3: a] :
( ( ( c_less_ @ X1 @ X2 )
& ( c_less_ @ X2 @ X3 ) )
=> ( c_less_ @ X1 @ X3 ) )
& ! [X4: b] : ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cF @ X4 ) ) )
& ( cG
= ( ^ [Z0: b] : ( cF @ ( cF @ Z0 ) ) ) ) )
=> ! [X6: b] : ( c_less_ @ ( cA @ X6 ) @ ( cA @ ( cG @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM89A_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X12: a,X13: a,X14: a,X15: b] :
( ( ~ ( c_less_ @ X12 @ X13 )
| ~ ( c_less_ @ X13 @ X14 )
| ( c_less_ @ X12 @ X14 ) )
& ( c_less_ @ ( cA @ X15 ) @ ( cA @ ( cF @ X15 ) ) )
& ( cG
= ( ^ [Z0: b] : ( cF @ ( cF @ Z0 ) ) ) )
& ~ ( c_less_ @ ( cA @ esk1_0 ) @ ( cA @ ( cG @ esk1_0 ) ) ) ),
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,
! [X1: a,X2: a,X3: a] :
( ( c_less_ @ X1 @ X3 )
| ~ ( c_less_ @ X1 @ X2 )
| ~ ( c_less_ @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X4: b] : ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cF @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( cG
= ( ^ [Z0: b] : ( cF @ ( cF @ Z0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X1: a,X4: b] :
( ( c_less_ @ X1 @ ( cA @ ( cF @ X4 ) ) )
| ~ ( c_less_ @ X1 @ ( cA @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X4: b] :
( ( cF @ ( cF @ X4 ) )
= ( cG @ X4 ) ),
inference(arg_cong,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
~ ( c_less_ @ ( cA @ esk1_0 ) @ ( cA @ ( cG @ esk1_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X1: a,X4: b] :
( ( c_less_ @ X1 @ ( cA @ ( cG @ X4 ) ) )
| ~ ( c_less_ @ X1 @ ( cA @ ( cF @ X4 ) ) ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_4])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEV059^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n026.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 19:05:08 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running higher-order theorem proving
% 0.14/0.40 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.41 # Version: 3.1.0-ho
% 0.14/0.41 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.14/0.41 # Starting post_as_ho10 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_9 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # new_bool_9 with pid 20663 completed with status 0
% 0.14/0.41 # Result found by new_bool_9
% 0.14/0.41 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.14/0.41 # Starting post_as_ho10 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_9 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.14/0.41 # Search class: HHUSF-FFSF11-MSSFFFNN
% 0.14/0.41 # partial match(1): HHUSF-FFSF11-SSSFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting sh3 with 163s (1) cores
% 0.14/0.41 # sh3 with pid 20665 completed with status 0
% 0.14/0.41 # Result found by sh3
% 0.14/0.41 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.14/0.41 # Starting post_as_ho10 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_9 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.14/0.41 # Search class: HHUSF-FFSF11-MSSFFFNN
% 0.14/0.41 # partial match(1): HHUSF-FFSF11-SSSFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting sh3 with 163s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Theorem
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 7
% 0.14/0.41 # Removed by relevancy pruning/SinE : 6
% 0.14/0.41 # Initial clauses : 4
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 4
% 0.14/0.41 # Processed clauses : 13
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 0
% 0.14/0.41 # ...remaining for further processing : 13
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 0
% 0.14/0.41 # Backward-rewritten : 0
% 0.14/0.41 # Generated clauses : 13
% 0.14/0.41 # ...of the previous two non-redundant : 7
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 12
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 7
% 0.14/0.41 # ...of those cached : 2
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 9
% 0.14/0.41 # Positive orientable unit clauses : 5
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 1
% 0.14/0.41 # Non-unit-clauses : 3
% 0.14/0.41 # Current number of unprocessed clauses: 2
% 0.14/0.41 # ...number of literals in the above : 5
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 4
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.41 # Non-unit clause-clause subsumptions : 0
% 0.14/0.41 # Unit Clause-clause subsumption calls : 0
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 0
% 0.14/0.41 # BW rewrite match successes : 0
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 570
% 0.14/0.41 # Search garbage collected termcells : 134
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.002 s
% 0.14/0.41 # System time : 0.002 s
% 0.14/0.41 # Total time : 0.004 s
% 0.14/0.41 # Maximum resident set size: 1800 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.002 s
% 0.14/0.41 # System time : 0.004 s
% 0.14/0.41 # Total time : 0.007 s
% 0.14/0.41 # Maximum resident set size: 1720 pages
% 0.14/0.41 % E---3.1 exiting
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------