TSTP Solution File: SEU972^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU972^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 03:30:59 EDT 2024
% Result : Theorem 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 22 ( 6 unt; 10 typ; 0 def)
% Number of atoms : 57 ( 56 equ; 0 cnn)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 369 ( 29 ~; 27 |; 31 &; 266 @)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 23 ( 23 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 8 ^ 42 !; 2 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
cR: a > a ).
thf(decl_23,type,
cP: a > a > a ).
thf(decl_24,type,
cL: a > a ).
thf(decl_25,type,
cZ: a ).
thf(decl_26,type,
esk1_1: ( a > $o ) > a ).
thf(decl_27,type,
esk2_1: ( a > $o ) > a ).
thf(decl_28,type,
esk3_0: a ).
thf(decl_29,type,
esk4_1: ( a > $o ) > a ).
thf(decl_30,type,
esk5_1: ( a > $o ) > a ).
thf(cPU_LEM2E_pme,conjecture,
( ( ( ( cL @ cZ )
= cZ )
& ( ( cR @ cZ )
= cZ )
& ! [X1: a,X2: a] :
( ( cL @ ( cP @ X1 @ X2 ) )
= X1 )
& ! [X1: a,X2: a] :
( ( cR @ ( cP @ X1 @ X2 ) )
= X2 )
& ! [X3: a] :
( ( X3 != cZ )
<=> ( X3
= ( cP @ ( cL @ X3 ) @ ( cR @ X3 ) ) ) )
& ! [X4: a > $o] :
( ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X3 = cZ )
<=> ( X5 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) )
=> ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( X3 = X5 ) ) ) )
=> ! [X3: a] :
? [X4: a > $o] :
( ( X4 @ ( cP @ cZ @ X3 ) )
& ! [X6: a,X5: a] :
( ( X4 @ ( cP @ X6 @ X5 ) )
=> ( ( ( X5 = cZ )
=> ( X6 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X6 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X6 ) @ ( cR @ X5 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cPU_LEM2E_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ( ( cL @ cZ )
= cZ )
& ( ( cR @ cZ )
= cZ )
& ! [X1: a,X2: a] :
( ( cL @ ( cP @ X1 @ X2 ) )
= X1 )
& ! [X1: a,X2: a] :
( ( cR @ ( cP @ X1 @ X2 ) )
= X2 )
& ! [X3: a] :
( ( X3 != cZ )
<=> ( X3
= ( cP @ ( cL @ X3 ) @ ( cR @ X3 ) ) ) )
& ! [X4: a > $o] :
( ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X3 = cZ )
<=> ( X5 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) )
=> ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( X3 = X5 ) ) ) )
=> ! [X3: a] :
? [X4: a > $o] :
( ( X4 @ ( cP @ cZ @ X3 ) )
& ! [X6: a,X5: a] :
( ( X4 @ ( cP @ X6 @ X5 ) )
=> ( ( ( X5 = cZ )
=> ( X6 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X6 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X6 ) @ ( cR @ X5 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cPU_LEM2E_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X21: a,X22: a,X23: a,X24: a,X25: a,X26: a > $o,X29: a,X30: a,X32: a > $o] :
( ( ( cL @ cZ )
= cZ )
& ( ( cR @ cZ )
= cZ )
& ( ( cL @ ( cP @ X21 @ X22 ) )
= X21 )
& ( ( cR @ ( cP @ X23 @ X24 ) )
= X24 )
& ( ( X25 = cZ )
| ( X25
= ( cP @ ( cL @ X25 ) @ ( cR @ X25 ) ) ) )
& ( ( X25
!= ( cP @ ( cL @ X25 ) @ ( cR @ X25 ) ) )
| ( X25 != cZ ) )
& ( ( X26 @ ( cP @ ( esk1_1 @ X26 ) @ ( esk2_1 @ X26 ) ) )
| ~ ( X26 @ ( cP @ X29 @ X30 ) )
| ( X29 = X30 ) )
& ( ( ( esk1_1 @ X26 )
!= cZ )
| ( ( esk2_1 @ X26 )
!= cZ )
| ~ ( X26 @ ( cP @ ( cL @ ( esk1_1 @ X26 ) ) @ ( cL @ ( esk2_1 @ X26 ) ) ) )
| ~ ( X26 @ ( cP @ ( cR @ ( esk1_1 @ X26 ) ) @ ( cR @ ( esk2_1 @ X26 ) ) ) )
| ~ ( X26 @ ( cP @ X29 @ X30 ) )
| ( X29 = X30 ) )
& ( ( ( esk1_1 @ X26 )
= cZ )
| ( ( esk2_1 @ X26 )
= cZ )
| ~ ( X26 @ ( cP @ ( cL @ ( esk1_1 @ X26 ) ) @ ( cL @ ( esk2_1 @ X26 ) ) ) )
| ~ ( X26 @ ( cP @ ( cR @ ( esk1_1 @ X26 ) ) @ ( cR @ ( esk2_1 @ X26 ) ) ) )
| ~ ( X26 @ ( cP @ X29 @ X30 ) )
| ( X29 = X30 ) )
& ( ( X32 @ ( cP @ ( esk4_1 @ X32 ) @ ( esk5_1 @ X32 ) ) )
| ~ ( X32 @ ( cP @ cZ @ esk3_0 ) ) )
& ( ( ( esk5_1 @ X32 )
= cZ )
| ~ ( X32 @ ( cP @ ( cL @ ( esk4_1 @ X32 ) ) @ ( cL @ ( esk5_1 @ X32 ) ) ) )
| ~ ( X32 @ ( cP @ ( cR @ ( esk4_1 @ X32 ) ) @ ( cR @ ( esk5_1 @ X32 ) ) ) )
| ~ ( X32 @ ( cP @ cZ @ esk3_0 ) ) )
& ( ( ( esk4_1 @ X32 )
!= cZ )
| ~ ( X32 @ ( cP @ ( cL @ ( esk4_1 @ X32 ) ) @ ( cL @ ( esk5_1 @ X32 ) ) ) )
| ~ ( X32 @ ( cP @ ( cR @ ( esk4_1 @ X32 ) ) @ ( cR @ ( esk5_1 @ X32 ) ) ) )
| ~ ( X32 @ ( cP @ cZ @ 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,
! [X4: a > $o] :
( ( X4 @ ( cP @ ( esk4_1 @ X4 ) @ ( esk5_1 @ X4 ) ) )
| ~ ( X4 @ ( cP @ cZ @ esk3_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X35: a > a,X36: a > a] :
( ( ( X35
@ ( cP
@ ( esk4_1
@ ^ [Z0: a] :
( ( X35 @ Z0 )
= ( X36 @ Z0 ) ) )
@ ( esk5_1
@ ^ [Z0: a] :
( ( X35 @ Z0 )
= ( X36 @ Z0 ) ) ) ) )
= ( X36
@ ( cP
@ ( esk4_1
@ ^ [Z0: a] :
( ( X35 @ Z0 )
= ( X36 @ Z0 ) ) )
@ ( esk5_1
@ ^ [Z0: a] :
( ( X35 @ Z0 )
= ( X36 @ Z0 ) ) ) ) ) )
| ( ( X35 @ ( cP @ cZ @ esk3_0 ) )
!= ( X36 @ ( cP @ cZ @ esk3_0 ) ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X2: a,X1: a] :
( ( cL @ ( cP @ X1 @ X2 ) )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X35: a > a] :
( ( ( X35
@ ( cP
@ ( esk4_1
@ ^ [Z0: a] :
( ( X35 @ Z0 )
= ( cL @ Z0 ) ) )
@ ( esk5_1
@ ^ [Z0: a] :
( ( X35 @ Z0 )
= ( cL @ Z0 ) ) ) ) )
= ( esk4_1
@ ^ [Z0: a] :
( ( X35 @ Z0 )
= ( cL @ Z0 ) ) ) )
| ( ( X35 @ ( cP @ cZ @ esk3_0 ) )
!= cZ ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X4: a > $o] :
( ( ( esk4_1 @ X4 )
!= cZ )
| ~ ( X4 @ ( cP @ ( cL @ ( esk4_1 @ X4 ) ) @ ( cL @ ( esk5_1 @ X4 ) ) ) )
| ~ ( X4 @ ( cP @ ( cR @ ( esk4_1 @ X4 ) ) @ ( cR @ ( esk5_1 @ X4 ) ) ) )
| ~ ( X4 @ ( cP @ cZ @ esk3_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( ( esk4_1
@ ^ [Z0: a] :
( cZ
= ( cL @ Z0 ) ) )
= cZ ),
inference(er,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ( cR @ cZ )
= cZ ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
( ( cL @ cZ )
= cZ ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8])]),c_0_9]),c_0_5]),c_0_10]),c_0_5]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU972^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 16:20:07 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running higher-order theorem proving
% 0.18/0.45 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.18/0.46 # Version: 3.1.0-ho
% 0.18/0.46 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting post_as_ho1 with 1500s (5) cores
% 0.18/0.46 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.46 # Starting new_ho_3 with 300s (1) cores
% 0.18/0.46 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.18/0.46 # ehoh_best2_full_lfho with pid 7055 completed with status 0
% 0.18/0.46 # Result found by ehoh_best2_full_lfho
% 0.18/0.46 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting post_as_ho1 with 1500s (5) cores
% 0.18/0.46 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.46 # Starting new_ho_3 with 300s (1) cores
% 0.18/0.46 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.18/0.46 # No SInE strategy applied
% 0.18/0.46 # Search class: HGHSS-FFSF21-MSSFFMBN
% 0.18/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting post_as_ho12 with 135s (1) cores
% 0.18/0.46 # post_as_ho12 with pid 7063 completed with status 0
% 0.18/0.46 # Result found by post_as_ho12
% 0.18/0.46 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting post_as_ho1 with 1500s (5) cores
% 0.18/0.46 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.46 # Starting new_ho_3 with 300s (1) cores
% 0.18/0.46 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.18/0.46 # No SInE strategy applied
% 0.18/0.46 # Search class: HGHSS-FFSF21-MSSFFMBN
% 0.18/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting post_as_ho12 with 135s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46 # Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Theorem
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 6
% 0.18/0.46 # Removed by relevancy pruning/SinE : 0
% 0.18/0.46 # Initial clauses : 17
% 0.18/0.46 # Removed in clause preprocessing : 5
% 0.18/0.46 # Initial clauses in saturation : 12
% 0.18/0.46 # Processed clauses : 37
% 0.18/0.46 # ...of these trivial : 1
% 0.18/0.46 # ...subsumed : 1
% 0.18/0.46 # ...remaining for further processing : 35
% 0.18/0.46 # Other redundant clauses eliminated : 17
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 1
% 0.18/0.46 # Backward-rewritten : 0
% 0.18/0.46 # Generated clauses : 130
% 0.18/0.46 # ...of the previous two non-redundant : 92
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 0
% 0.18/0.46 # Paramodulations : 76
% 0.18/0.46 # Factorizations : 10
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 26
% 0.18/0.46 # Disequality decompositions : 0
% 0.18/0.46 # Total rewrite steps : 20
% 0.18/0.46 # ...of those cached : 6
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 21
% 0.18/0.46 # Positive orientable unit clauses : 6
% 0.18/0.46 # Positive unorientable unit clauses: 0
% 0.18/0.46 # Negative unit clauses : 2
% 0.18/0.46 # Non-unit-clauses : 13
% 0.18/0.46 # Current number of unprocessed clauses: 8
% 0.18/0.46 # ...number of literals in the above : 27
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 13
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 31
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 12
% 0.18/0.46 # Non-unit clause-clause subsumptions : 2
% 0.18/0.46 # Unit Clause-clause subsumption calls : 3
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 0
% 0.18/0.46 # BW rewrite match successes : 0
% 0.18/0.46 # Condensation attempts : 0
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 11333
% 0.18/0.46 # Search garbage collected termcells : 507
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.006 s
% 0.18/0.46 # System time : 0.001 s
% 0.18/0.46 # Total time : 0.007 s
% 0.18/0.46 # Maximum resident set size: 1744 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.007 s
% 0.18/0.46 # System time : 0.002 s
% 0.18/0.46 # Total time : 0.010 s
% 0.18/0.46 # Maximum resident set size: 1720 pages
% 0.18/0.46 % E---3.1 exiting
% 0.18/0.46 % E exiting
%------------------------------------------------------------------------------