TSTP Solution File: SEU945^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU945^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 03:30:55 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 4 unt; 2 typ; 0 def)
% Number of atoms : 18 ( 15 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 69 ( 5 ~; 2 |; 1 &; 58 @)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 8 ^ 14 !; 2 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
esk1_1: ( $i > $i > $o ) > $i ).
thf(decl_23,type,
esk2_1: ( $i > $i > $o ) > $i ).
thf(cTHM3_pme,conjecture,
? [X1: $i > $i > $o] :
! [X2: $i,X3: $i] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM3_pme) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: $i > $i > $o] :
! [X2: $i,X3: $i] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) ),
inference(assume_negation,[status(cth)],[cTHM3_pme]) ).
thf(c_0_2,negated_conjecture,
! [X7: $i > $i > $o] :
( ( ( X7 @ ( esk1_1 @ X7 ) )
= ( X7 @ ( esk2_1 @ X7 ) ) )
& ( ( esk1_1 @ X7 )
!= ( esk2_1 @ X7 ) ) ),
inference(fof_nnf,[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: $i > $i > $o] :
( ( X1 @ ( esk1_1 @ X1 ) )
= ( X1 @ ( esk2_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i > $i > $o,X10: $i] :
( ( X1 @ ( esk2_1 @ X1 ) @ X10 )
<=> ( X1 @ ( esk1_1 @ X1 ) @ X10 ) ),
inference(arg_cong,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i > $i > $o,X2: $i] :
( ( X1 @ ( esk2_1 @ X1 ) @ X2 )
| ~ ( X1 @ ( esk1_1 @ X1 ) @ X2 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X18: $i > $i > $i,X17: $i > $i > $i,X2: $i] :
( ( ( X17
@ ( esk2_1
@ ^ [Z0: $i,Z1: $i] :
( ( X17 @ Z0 @ Z1 )
= ( X18 @ Z0 @ Z1 ) ) )
@ X2 )
= ( X18
@ ( esk2_1
@ ^ [Z0: $i,Z1: $i] :
( ( X17 @ Z0 @ Z1 )
= ( X18 @ Z0 @ Z1 ) ) )
@ X2 ) )
| ( ( X17
@ ( esk1_1
@ ^ [Z0: $i,Z1: $i] :
( ( X17 @ Z0 @ Z1 )
= ( X18 @ Z0 @ Z1 ) ) )
@ X2 )
!= ( X18
@ ( esk1_1
@ ^ [Z0: $i,Z1: $i] :
( ( X17 @ Z0 @ Z1 )
= ( X18 @ Z0 @ Z1 ) ) )
@ X2 ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i > $i > $o] :
( ( esk1_1 @ X1 )
!= ( esk2_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( ( esk2_1 @ $eq )
= ( esk1_1 @ $eq ) ),
inference(er,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_7,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU945^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 17:22:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running higher-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.22/0.51 # Version: 3.1.0-ho
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.51 # Starting post_as_ho4 with 300s (1) cores
% 0.22/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.22/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.51 # Starting full_lambda_10 with 300s (1) cores
% 0.22/0.51 # Starting new_ho_8 with 300s (1) cores
% 0.22/0.51 # new_bool_9 with pid 30163 completed with status 0
% 0.22/0.51 # Result found by new_bool_9
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.22/0.51 # Search class: HUUPF-FFSF11-SSSFFMBN
% 0.22/0.51 # partial match(1): HUUPF-FFSF11-SSSFFMNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting post_as_ho12 with 163s (1) cores
% 0.22/0.51 # post_as_ho12 with pid 30171 completed with status 0
% 0.22/0.51 # Result found by post_as_ho12
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.22/0.51 # Search class: HUUPF-FFSF11-SSSFFMBN
% 0.22/0.51 # partial match(1): HUUPF-FFSF11-SSSFFMNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting post_as_ho12 with 163s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 1
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 2
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 2
% 0.22/0.51 # Processed clauses : 9
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 9
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 19
% 0.22/0.51 # ...of the previous two non-redundant : 9
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 4
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 6
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 6
% 0.22/0.51 # ...of those cached : 5
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 6
% 0.22/0.52 # Positive orientable unit clauses : 1
% 0.22/0.52 # Positive unorientable unit clauses: 1
% 0.22/0.52 # Negative unit clauses : 1
% 0.22/0.52 # Non-unit-clauses : 3
% 0.22/0.52 # Current number of unprocessed clauses: 2
% 0.22/0.52 # ...number of literals in the above : 3
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 3
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.52 # Non-unit clause-clause subsumptions : 0
% 0.22/0.52 # Unit Clause-clause subsumption calls : 0
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 8
% 0.22/0.52 # BW rewrite match successes : 0
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 1041
% 0.22/0.52 # Search garbage collected termcells : 42
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.003 s
% 0.22/0.52 # System time : 0.001 s
% 0.22/0.52 # Total time : 0.004 s
% 0.22/0.52 # Maximum resident set size: 1812 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.003 s
% 0.22/0.52 # System time : 0.005 s
% 0.22/0.52 # Total time : 0.008 s
% 0.22/0.52 # Maximum resident set size: 1696 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------