TSTP Solution File: SYO361^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO361^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 08:45:43 EDT 2024
% Result : Theorem 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 9 unt; 4 typ; 0 def)
% Number of atoms : 24 ( 18 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 152 ( 14 ~; 32 |; 2 &; 100 @)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 20 ^ 21 !; 0 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
esk1_0: $i ).
thf(decl_23,type,
esk2_0: $i ).
thf(decl_24,type,
epred1_0: $i > $i > $o ).
thf(decl_25,type,
esk3_1: ( $i > $i > $o ) > $i ).
thf(cTHM47,conjecture,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
<=> ! [X3: $i > $i > $o] :
( ! [X4: $i] : ( X3 @ X4 @ X4 )
=> ( X3 @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM47) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: $i,X2: $i] :
( ( X1 = X2 )
<=> ! [X3: $i > $i > $o] :
( ! [X4: $i] : ( X3 @ X4 @ X4 )
=> ( X3 @ X1 @ X2 ) ) ),
inference(assume_negation,[status(cth)],[cTHM47]) ).
thf(c_0_2,negated_conjecture,
! [X12: $i,X13: $i > $i > $o] :
( ( ( epred1_0 @ X12 @ X12 )
| ( esk1_0 != esk2_0 ) )
& ( ~ ( epred1_0 @ esk1_0 @ esk2_0 )
| ( esk1_0 != esk2_0 ) )
& ( ( esk1_0 = esk2_0 )
| ~ ( X13 @ ( esk3_1 @ X13 ) @ ( esk3_1 @ X13 ) )
| ( X13 @ esk1_0 @ esk2_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,
! [X3: $i > $i > $o] :
( ( esk1_0 = esk2_0 )
| ( X3 @ esk1_0 @ esk2_0 )
| ~ ( X3 @ ( esk3_1 @ X3 ) @ ( esk3_1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X19: $i > $i > $o,X18: $i > $i > $o] :
( ( esk1_0 = esk2_0 )
| ( X19 @ esk1_0 @ esk2_0 )
| ( X18 @ esk1_0 @ esk2_0 )
| ~ ( ( X19
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X19 @ Z0 @ Z1 )
| ( X18 @ Z0 @ Z1 ) ) )
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X19 @ Z0 @ Z1 )
| ( X18 @ Z0 @ Z1 ) ) ) )
| ( X18
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X19 @ Z0 @ Z1 )
| ( X18 @ Z0 @ Z1 ) ) )
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X19 @ Z0 @ Z1 )
| ( X18 @ Z0 @ Z1 ) ) ) ) ) ),
inference(primitive_enumeration,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X7: $i > $i > $o,X3: $i > $i > $o] :
( ( esk1_0 = esk2_0 )
| ( X3 @ esk1_0 @ esk2_0 )
| ( X7 @ esk1_0 @ esk2_0 )
| ~ ( X3
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X7 @ Z0 @ Z1 )
| ( X3 @ Z0 @ Z1 ) ) )
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X7 @ Z0 @ Z1 )
| ( X3 @ Z0 @ Z1 ) ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X7: $i > $i > $o,X3: $i > $i > $o] :
( ( esk1_0 = esk2_0 )
| ( X3 @ esk1_0 @ esk2_0 )
| ( X7 @ esk1_0 @ esk2_0 )
| ~ ( X7
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X7 @ Z0 @ Z1 )
| ( X3 @ Z0 @ Z1 ) ) )
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X7 @ Z0 @ Z1 )
| ( X3 @ Z0 @ Z1 ) ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X3: $i > $i > $o] :
( ( ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X3 @ Z0 @ Z1 )
| ( Z1 != esk2_0 ) ) )
= esk2_0 )
| ( esk1_0 = esk2_0 )
| ( X3 @ esk1_0 @ esk2_0 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X3: $i > $i > $o] :
( ( ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( Z0 != esk1_0 )
| ( X3 @ Z0 @ Z1 ) ) )
= esk1_0 )
| ( esk1_0 = esk2_0 )
| ( X3 @ esk1_0 @ esk2_0 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 @ X1 )
| ( esk1_0 != esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
esk1_0 = esk2_0,
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8])])]) ).
thf(c_0_11,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 @ esk2_0 )
| ( esk1_0 != esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i] : ( epred1_0 @ X1 @ X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10]),c_0_10])]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO361^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n019.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Mon May 20 09:46:37 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.18/0.47 Running higher-order theorem proving
% 0.18/0.47 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.18/0.49 # Version: 3.1.0-ho
% 0.18/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.18/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.18/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.18/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.18/0.49 # Starting post_as_ho2 with 300s (1) cores
% 0.18/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.18/0.49 # Starting full_lambda_10 with 300s (1) cores
% 0.18/0.49 # Starting new_ho_8 with 300s (1) cores
% 0.18/0.49 # post_as_ho2 with pid 6377 completed with status 0
% 0.18/0.49 # Result found by post_as_ho2
% 0.18/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.18/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.18/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.18/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.18/0.49 # Starting post_as_ho2 with 300s (1) cores
% 0.18/0.49 # No SInE strategy applied
% 0.18/0.49 # Search class: HGHSF-FFSF11-SSSFFSBN
% 0.18/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 0.18/0.49 # ehoh_best2_full_lfho with pid 6384 completed with status 0
% 0.18/0.49 # Result found by ehoh_best2_full_lfho
% 0.18/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.18/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.18/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.18/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.18/0.49 # Starting post_as_ho2 with 300s (1) cores
% 0.18/0.49 # No SInE strategy applied
% 0.18/0.49 # Search class: HGHSF-FFSF11-SSSFFSBN
% 0.18/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 0.18/0.49 # Preprocessing time : 0.001 s
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Theorem
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 1
% 0.18/0.49 # Removed by relevancy pruning/SinE : 0
% 0.18/0.49 # Initial clauses : 3
% 0.18/0.49 # Removed in clause preprocessing : 0
% 0.18/0.49 # Initial clauses in saturation : 3
% 0.18/0.49 # Processed clauses : 101
% 0.18/0.49 # ...of these trivial : 0
% 0.18/0.49 # ...subsumed : 10
% 0.18/0.49 # ...remaining for further processing : 90
% 0.18/0.49 # Other redundant clauses eliminated : 0
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 20
% 0.18/0.49 # Backward-rewritten : 41
% 0.18/0.49 # Generated clauses : 150
% 0.18/0.49 # ...of the previous two non-redundant : 133
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 0
% 0.18/0.49 # Paramodulations : 59
% 0.18/0.49 # Factorizations : 3
% 0.18/0.49 # NegExts : 15
% 0.18/0.49 # Equation resolutions : 0
% 0.18/0.49 # Disequality decompositions : 0
% 0.18/0.49 # Total rewrite steps : 99
% 0.18/0.49 # ...of those cached : 95
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 17
% 0.18/0.49 # Positive orientable unit clauses : 2
% 0.18/0.49 # Positive unorientable unit clauses: 0
% 0.18/0.49 # Negative unit clauses : 0
% 0.18/0.49 # Non-unit-clauses : 15
% 0.18/0.49 # Current number of unprocessed clauses: 33
% 0.18/0.49 # ...number of literals in the above : 119
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 73
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 1365
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 378
% 0.18/0.49 # Non-unit clause-clause subsumptions : 30
% 0.18/0.49 # Unit Clause-clause subsumption calls : 16
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 3
% 0.18/0.49 # BW rewrite match successes : 2
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 8185
% 0.18/0.49 # Search garbage collected termcells : 118
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.013 s
% 0.18/0.49 # System time : 0.002 s
% 0.18/0.49 # Total time : 0.015 s
% 0.18/0.49 # Maximum resident set size: 1764 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.013 s
% 0.18/0.49 # System time : 0.005 s
% 0.18/0.49 # Total time : 0.018 s
% 0.18/0.49 # Maximum resident set size: 1700 pages
% 0.18/0.49 % E---3.1 exiting
% 0.18/0.49 % E exiting
%------------------------------------------------------------------------------