TSTP Solution File: SYO222^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO222^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:11 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 6 unt; 4 typ; 0 def)
% Number of atoms : 29 ( 14 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 110 ( 13 ~; 15 |; 9 &; 67 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 2 ^ 23 !; 4 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
f: $i > $i ).
thf(decl_23,type,
a: $i ).
thf(decl_24,type,
cP: $i > $o ).
thf(decl_25,type,
esk1_1: ( $i > $o ) > $i ).
thf(cTHM115A,conjecture,
? [X1: $i > $o] :
( ! [X2: $i] :
( ( X1 @ ( f @ X2 ) )
=> ( cP @ X2 ) )
& ( ( ( cP @ a )
& ! [X2: $i,X3: $i] :
( ( ( f @ X2 )
= ( f @ X3 ) )
=> ( X2 = X3 ) ) )
=> ? [X4: $i] : ( X1 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM115A) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: $i > $o] :
( ! [X2: $i] :
( ( X1 @ ( f @ X2 ) )
=> ( cP @ X2 ) )
& ( ( ( cP @ a )
& ! [X2: $i,X3: $i] :
( ( ( f @ X2 )
= ( f @ X3 ) )
=> ( X2 = X3 ) ) )
=> ? [X4: $i] : ( X1 @ X4 ) ) ),
inference(assume_negation,[status(cth)],[cTHM115A]) ).
thf(c_0_2,negated_conjecture,
! [X10: $i > $o,X12: $i,X13: $i,X14: $i] :
( ( ( cP @ a )
| ( X10 @ ( f @ ( esk1_1 @ X10 ) ) ) )
& ( ( ( f @ X12 )
!= ( f @ X13 ) )
| ( X12 = X13 )
| ( X10 @ ( f @ ( esk1_1 @ X10 ) ) ) )
& ( ~ ( X10 @ X14 )
| ( X10 @ ( f @ ( esk1_1 @ X10 ) ) ) )
& ( ( cP @ a )
| ~ ( cP @ ( esk1_1 @ X10 ) ) )
& ( ( ( f @ X12 )
!= ( f @ X13 ) )
| ( X12 = X13 )
| ~ ( cP @ ( esk1_1 @ X10 ) ) )
& ( ~ ( X10 @ X14 )
| ~ ( cP @ ( esk1_1 @ X10 ) ) ) ),
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,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( f @ ( esk1_1 @ X1 ) ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i > $o,X2: $i,X3: $i] :
( ( X2 = X3 )
| ( X1 @ ( f @ ( esk1_1 @ X1 ) ) )
| ( ( f @ X2 )
!= ( f @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X2: $i] :
( ( f
@ ( esk1_1
@ ^ [Z0: $i] : ( Z0 = X2 ) ) )
= X2 ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i,X1: $i > $o] :
( ~ ( X1 @ X2 )
| ~ ( cP @ ( esk1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i,X1: $i > $o] :
( ( ( esk1_1
@ ^ [Z0: $i] :
( Z0
= ( f @ X2 ) ) )
= X2 )
| ( X1 @ ( f @ ( esk1_1 @ X1 ) ) ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5])]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i > $o] :
( ( cP @ a )
| ( X1 @ ( f @ ( esk1_1 @ X1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( f @ ( esk1_1 @ X1 ) ) )
| ~ ( cP @ X2 ) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7])])]) ).
thf(c_0_10,negated_conjecture,
cP @ ( f @ ( esk1_1 @ cP ) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_8])]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(flex_resolve,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYO222^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 10:26:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/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.19/0.50 # Version: 3.1.0-ho
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.50 # Starting post_as_ho4 with 300s (1) cores
% 0.19/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.19/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.19/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.19/0.50 # Starting new_ho_8 with 300s (1) cores
% 0.19/0.50 # new_bool_9 with pid 28859 completed with status 0
% 0.19/0.50 # Result found by new_bool_9
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.19/0.50 # Search class: HGHSF-FFSF11-SSSFFMBN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting ho_unfolding_6 with 163s (1) cores
% 0.19/0.50 # ho_unfolding_6 with pid 28866 completed with status 0
% 0.19/0.50 # Result found by ho_unfolding_6
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.19/0.50 # Search class: HGHSF-FFSF11-SSSFFMBN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting ho_unfolding_6 with 163s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 4
% 0.19/0.50 # Removed by relevancy pruning/SinE : 3
% 0.19/0.50 # Initial clauses : 6
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 6
% 0.19/0.50 # Processed clauses : 82
% 0.19/0.50 # ...of these trivial : 2
% 0.19/0.50 # ...subsumed : 45
% 0.19/0.50 # ...remaining for further processing : 34
% 0.19/0.50 # Other redundant clauses eliminated : 24
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 0
% 0.19/0.50 # Generated clauses : 498
% 0.19/0.50 # ...of the previous two non-redundant : 449
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 469
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 28
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 9
% 0.19/0.50 # ...of those cached : 6
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 34
% 0.19/0.50 # Positive orientable unit clauses : 1
% 0.19/0.50 # Positive unorientable unit clauses: 3
% 0.19/0.50 # Negative unit clauses : 0
% 0.19/0.50 # Non-unit-clauses : 30
% 0.19/0.50 # Current number of unprocessed clauses: 373
% 0.19/0.50 # ...number of literals in the above : 926
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 0
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 232
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 232
% 0.19/0.50 # Non-unit clause-clause subsumptions : 41
% 0.19/0.50 # Unit Clause-clause subsumption calls : 33
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 68
% 0.19/0.50 # BW rewrite match successes : 35
% 0.19/0.50 # Condensation attempts : 82
% 0.19/0.50 # Condensation successes : 1
% 0.19/0.50 # Termbank termtop insertions : 47715
% 0.19/0.50 # Search garbage collected termcells : 141
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.019 s
% 0.19/0.50 # System time : 0.002 s
% 0.19/0.50 # Total time : 0.021 s
% 0.19/0.50 # Maximum resident set size: 1756 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.019 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.024 s
% 0.19/0.50 # Maximum resident set size: 1700 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------