TSTP Solution File: SYO038^1.003.003 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO038^1.003.003 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:44:19 EDT 2024
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 33 unt; 4 typ; 0 def)
% Number of atoms : 47 ( 18 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 292 ( 9 ~; 6 |; 0 &; 276 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 0 ^ 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
one: $i ).
thf(decl_23,type,
s: $i > $i ).
thf(decl_24,type,
f: $i > $i > $i ).
thf(decl_25,type,
d: $i > $o ).
thf(ax5,axiom,
! [X2: $i] :
( ( d @ X2 )
=> ( d @ ( s @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
thf(ax2,axiom,
! [X2: $i] :
( ( f @ one @ ( s @ X2 ) )
= ( s @ ( s @ ( f @ one @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
thf(ax1,axiom,
! [X1: $i] :
( ( f @ X1 @ one )
= ( s @ one ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
thf(ax4,axiom,
d @ one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
thf(ax3,axiom,
! [X1: $i,X2: $i] :
( ( f @ ( s @ X1 ) @ ( s @ X2 ) )
= ( f @ X1 @ ( f @ ( s @ X1 ) @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
thf(conj,conjecture,
d @ ( f @ ( s @ ( s @ one ) ) @ ( s @ ( s @ one ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_6,plain,
! [X12: $i] :
( ~ ( d @ X12 )
| ( d @ ( s @ X12 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])]) ).
thf(c_0_7,plain,
! [X9: $i] :
( ( f @ one @ ( s @ X9 ) )
= ( s @ ( s @ ( f @ one @ X9 ) ) ) ),
inference(variable_rename,[status(thm)],[ax2]) ).
thf(c_0_8,plain,
! [X8: $i] :
( ( f @ X8 @ one )
= ( s @ one ) ),
inference(variable_rename,[status(thm)],[ax1]) ).
thf(c_0_9,plain,
! [X1: $i] :
( ( d @ ( s @ X1 ) )
| ~ ( d @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X1: $i] :
( ( f @ one @ ( s @ X1 ) )
= ( s @ ( s @ ( f @ one @ X1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X1: $i] :
( ( f @ X1 @ one )
= ( s @ one ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X1: $i] :
( ( d @ ( f @ one @ ( s @ X1 ) ) )
| ~ ( d @ ( s @ ( f @ one @ X1 ) ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,plain,
( ( f @ one @ ( s @ one ) )
= ( s @ ( s @ ( s @ one ) ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,plain,
! [X1: $i] :
( ( d @ ( f @ one @ ( s @ X1 ) ) )
| ~ ( d @ ( f @ one @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
thf(c_0_15,plain,
( ( f @ one @ ( s @ ( s @ one ) ) )
= ( s @ ( s @ ( s @ ( s @ ( s @ one ) ) ) ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
thf(c_0_16,plain,
( ( d @ ( s @ ( s @ ( s @ one ) ) ) )
| ~ ( d @ ( s @ one ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_11]),c_0_13]) ).
thf(c_0_17,plain,
d @ one,
inference(split_conjunct,[status(thm)],[ax4]) ).
thf(c_0_18,plain,
( ( s @ ( s @ ( s @ ( s @ ( s @ ( s @ ( s @ one ) ) ) ) ) ) )
= ( f @ one @ ( s @ ( s @ ( s @ one ) ) ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
thf(c_0_19,plain,
d @ ( s @ ( s @ ( s @ one ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_9]),c_0_17])]) ).
thf(c_0_20,plain,
( ( d @ ( f @ one @ ( s @ ( s @ ( s @ one ) ) ) ) )
| ~ ( d @ ( s @ ( s @ ( s @ ( s @ ( s @ ( s @ one ) ) ) ) ) ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_18]) ).
thf(c_0_21,plain,
d @ ( s @ ( s @ ( s @ ( s @ ( s @ one ) ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_15]),c_0_19])]) ).
thf(c_0_22,plain,
! [X10: $i,X11: $i] :
( ( f @ ( s @ X10 ) @ ( s @ X11 ) )
= ( f @ X10 @ ( f @ ( s @ X10 ) @ X11 ) ) ),
inference(variable_rename,[status(thm)],[ax3]) ).
thf(c_0_23,plain,
d @ ( f @ one @ ( s @ ( s @ ( s @ one ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_9]),c_0_21])]) ).
thf(c_0_24,plain,
! [X1: $i,X2: $i] :
( ( f @ ( s @ X1 ) @ ( s @ X2 ) )
= ( f @ X1 @ ( f @ ( s @ X1 ) @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_25,plain,
d @ ( f @ one @ ( s @ ( s @ ( s @ ( s @ one ) ) ) ) ),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
thf(c_0_26,plain,
! [X1: $i] :
( ( f @ ( s @ X1 ) @ ( s @ one ) )
= ( f @ X1 @ ( s @ one ) ) ),
inference(spm,[status(thm)],[c_0_24,c_0_11]) ).
thf(c_0_27,plain,
d @ ( f @ one @ ( s @ ( s @ ( s @ ( s @ ( s @ one ) ) ) ) ) ),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
thf(c_0_28,plain,
! [X1: $i] :
( ( f @ X1 @ ( f @ X1 @ ( s @ one ) ) )
= ( f @ ( s @ X1 ) @ ( s @ ( s @ one ) ) ) ),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
thf(c_0_29,negated_conjecture,
~ ( d @ ( f @ ( s @ ( s @ one ) ) @ ( s @ ( s @ one ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]) ).
thf(c_0_30,plain,
d @ ( f @ one @ ( s @ ( s @ ( s @ ( s @ ( s @ ( s @ one ) ) ) ) ) ) ),
inference(spm,[status(thm)],[c_0_14,c_0_27]) ).
thf(c_0_31,plain,
( ( f @ ( s @ one ) @ ( s @ ( s @ one ) ) )
= ( f @ one @ ( s @ ( s @ ( s @ one ) ) ) ) ),
inference(spm,[status(thm)],[c_0_28,c_0_13]) ).
thf(c_0_32,negated_conjecture,
~ ( d @ ( f @ ( s @ ( s @ one ) ) @ ( s @ ( s @ one ) ) ) ),
inference(fof_nnf,[status(thm)],[c_0_29]) ).
thf(c_0_33,plain,
! [X1: $i] :
( ( f @ ( s @ X1 ) @ ( f @ X1 @ ( s @ one ) ) )
= ( f @ ( s @ ( s @ X1 ) ) @ ( s @ ( s @ one ) ) ) ),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
thf(c_0_34,plain,
d @ ( f @ one @ ( f @ one @ ( s @ ( s @ ( s @ one ) ) ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_30]),c_0_18]) ).
thf(c_0_35,plain,
( ( f @ one @ ( f @ one @ ( s @ ( s @ ( s @ one ) ) ) ) )
= ( f @ ( s @ one ) @ ( s @ ( s @ ( s @ one ) ) ) ) ),
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
thf(c_0_36,negated_conjecture,
~ ( d @ ( f @ ( s @ ( s @ one ) ) @ ( s @ ( s @ one ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_37,plain,
( ( f @ ( s @ ( s @ one ) ) @ ( s @ ( s @ one ) ) )
= ( f @ ( s @ one ) @ ( s @ ( s @ ( s @ one ) ) ) ) ),
inference(spm,[status(thm)],[c_0_33,c_0_13]) ).
thf(c_0_38,plain,
d @ ( f @ ( s @ one ) @ ( s @ ( s @ ( s @ one ) ) ) ),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
thf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO038^1.003.003 : TPTP v8.2.0. Released v5.3.0.
% 0.08/0.09 % Command : run_E %s %d THM
% 0.08/0.29 % Computer : n012.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Mon May 20 09:59:52 EDT 2024
% 0.08/0.29 % CPUTime :
% 0.15/0.40 Running higher-order theorem proving
% 0.15/0.40 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.15/0.42 # Version: 3.1.0-ho
% 0.15/0.42 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting new_ho_10 with 1500s (5) cores
% 0.15/0.42 # Starting ho_unfolding_6 with 300s (1) cores
% 0.15/0.42 # Starting sh4l with 300s (1) cores
% 0.15/0.42 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.15/0.42 # new_ho_10 with pid 19838 completed with status 0
% 0.15/0.42 # Result found by new_ho_10
% 0.15/0.42 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting new_ho_10 with 1500s (5) cores
% 0.15/0.42 # No SInE strategy applied
% 0.15/0.42 # Search class: HHUSS-FFSF21-MFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.42 # Starting new_ho_10 with 301s (1) cores
% 0.15/0.42 # Starting sh5l with 301s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 301s (1) cores
% 0.15/0.42 # Starting new_bool_2 with 301s (1) cores
% 0.15/0.42 # Starting new_bool_9 with 296s (1) cores
% 0.15/0.42 # new_bool_1 with pid 19844 completed with status 0
% 0.15/0.42 # Result found by new_bool_1
% 0.15/0.42 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting new_ho_10 with 1500s (5) cores
% 0.15/0.42 # No SInE strategy applied
% 0.15/0.42 # Search class: HHUSS-FFSF21-MFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.42 # Starting new_ho_10 with 301s (1) cores
% 0.15/0.42 # Starting sh5l with 301s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 301s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 10
% 0.15/0.42 # Removed by relevancy pruning/SinE : 0
% 0.15/0.42 # Initial clauses : 10
% 0.15/0.42 # Removed in clause preprocessing : 4
% 0.15/0.42 # Initial clauses in saturation : 6
% 0.15/0.42 # Processed clauses : 67
% 0.15/0.42 # ...of these trivial : 6
% 0.15/0.42 # ...subsumed : 4
% 0.15/0.42 # ...remaining for further processing : 57
% 0.15/0.42 # Other redundant clauses eliminated : 0
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 7
% 0.15/0.42 # Generated clauses : 152
% 0.15/0.42 # ...of the previous two non-redundant : 120
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 152
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 0
% 0.15/0.42 # Disequality decompositions : 0
% 0.15/0.42 # Total rewrite steps : 204
% 0.15/0.42 # ...of those cached : 151
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 44
% 0.15/0.42 # Positive orientable unit clauses : 35
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 0
% 0.15/0.42 # Non-unit-clauses : 9
% 0.15/0.42 # Current number of unprocessed clauses: 65
% 0.15/0.42 # ...number of literals in the above : 90
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 13
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 51
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 51
% 0.15/0.42 # Non-unit clause-clause subsumptions : 4
% 0.15/0.42 # Unit Clause-clause subsumption calls : 1
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 75
% 0.15/0.42 # BW rewrite match successes : 6
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 4902
% 0.15/0.42 # Search garbage collected termcells : 39
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.007 s
% 0.15/0.42 # System time : 0.001 s
% 0.15/0.42 # Total time : 0.008 s
% 0.15/0.42 # Maximum resident set size: 1756 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.030 s
% 0.15/0.42 # System time : 0.004 s
% 0.15/0.42 # Total time : 0.034 s
% 0.15/0.42 # Maximum resident set size: 1700 pages
% 0.15/0.42 % E---3.1 exiting
% 0.15/0.42 % E exiting
%------------------------------------------------------------------------------