TSTP Solution File: SYO691-1.001 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYO691-1.001 : TPTP v8.2.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:54:44 EDT 2024
% Result : Unsatisfiable 24.30s 3.57s
% Output : CNFRefutation 24.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of clauses : 38 ( 10 unt; 0 nHn; 26 RR)
% Number of literals : 78 ( 0 equ; 47 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 124 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rewrite_sequence_succ,axiom,
( seq(succ(X1),X2,X4)
| ~ seq(X1,X2,X3)
| ~ step(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_sequence_succ) ).
cnf(rewrite_sequence_zero,axiom,
seq(zero,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_sequence_zero) ).
cnf(rewrite_left,axiom,
( step(f(X1,X3),f(X2,X3))
| ~ step(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_left) ).
cnf(rewrite_top,axiom,
( step(X1,X2)
| ~ top(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_top) ).
cnf(rule_1,axiom,
top(f(f(f(X1,a),X2),f(X3,a)),f(f(X3,f(f(X2,a),a)),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
cnf(rewrite_right,axiom,
( step(f(X3,X1),f(X3,X2))
| ~ step(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_right) ).
cnf(prove,negated_conjecture,
~ seq(succ(succ(succ(succ(succ(zero))))),X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
cnf(c_0_7,plain,
( seq(succ(X1),X2,X4)
| ~ seq(X1,X2,X3)
| ~ step(X3,X4) ),
inference(fof_simplification,[status(thm)],[rewrite_sequence_succ]) ).
cnf(c_0_8,plain,
( seq(succ(X1),X2,X4)
| ~ seq(X1,X2,X3)
| ~ step(X3,X4) ),
c_0_7 ).
cnf(c_0_9,axiom,
seq(zero,X1,X1),
rewrite_sequence_zero ).
cnf(c_0_10,plain,
( seq(succ(zero),X1,X2)
| ~ step(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( step(f(X1,X3),f(X2,X3))
| ~ step(X1,X2) ),
inference(fof_simplification,[status(thm)],[rewrite_left]) ).
cnf(c_0_12,plain,
( step(X1,X2)
| ~ top(X1,X2) ),
inference(fof_simplification,[status(thm)],[rewrite_top]) ).
cnf(c_0_13,plain,
( seq(succ(succ(zero)),X1,X2)
| ~ step(X3,X2)
| ~ step(X1,X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_14,plain,
( step(f(X1,X3),f(X2,X3))
| ~ step(X1,X2) ),
c_0_11 ).
cnf(c_0_15,plain,
( step(X1,X2)
| ~ top(X1,X2) ),
c_0_12 ).
cnf(c_0_16,axiom,
top(f(f(f(X1,a),X2),f(X3,a)),f(f(X3,f(f(X2,a),a)),X1)),
rule_1 ).
cnf(c_0_17,plain,
( seq(succ(succ(zero)),X1,f(X2,X3))
| ~ step(X1,f(X4,X3))
| ~ step(X4,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
step(f(f(f(X1,a),X2),f(X3,a)),f(f(X3,f(f(X2,a),a)),X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( seq(succ(succ(zero)),f(f(f(X1,a),X2),f(X3,a)),f(X4,X1))
| ~ step(f(X3,f(f(X2,a),a)),X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
( seq(succ(succ(succ(zero))),f(f(f(X1,a),X2),f(X3,a)),X4)
| ~ step(f(X3,f(f(X2,a),a)),X5)
| ~ step(f(X5,X1),X4) ),
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_21,plain,
( seq(succ(succ(succ(zero))),f(f(f(X1,a),X2),f(f(f(X3,a),X4),a)),X5)
| ~ step(f(f(f(f(X2,a),f(f(X4,a),a)),X3),X1),X5) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_22,plain,
( seq(succ(succ(succ(succ(zero)))),f(f(f(X1,a),X2),f(f(f(X3,a),X4),a)),X5)
| ~ step(f(f(f(f(X2,a),f(f(X4,a),a)),X3),X1),X6)
| ~ step(X6,X5) ),
inference(spm,[status(thm)],[c_0_8,c_0_21]) ).
cnf(c_0_23,plain,
( seq(succ(succ(succ(succ(zero)))),f(f(f(X1,a),X2),f(f(f(X3,a),X4),a)),X5)
| ~ step(f(f(f(X2,a),f(f(X4,a),a)),X3),X6)
| ~ step(f(X6,X1),X5) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_24,plain,
( seq(succ(succ(succ(succ(zero)))),f(f(f(X1,a),X2),f(f(f(X3,a),X4),a)),X5)
| ~ step(f(f(X2,a),f(f(X4,a),a)),X6)
| ~ step(f(f(X6,X3),X1),X5) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_25,plain,
( seq(succ(succ(succ(succ(zero)))),f(f(f(X1,a),f(X2,a)),f(f(f(X3,a),X4),a)),X5)
| ~ step(f(f(f(f(f(X4,a),f(f(a,a),a)),X2),X3),X1),X5) ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_26,plain,
( step(f(X3,X1),f(X3,X2))
| ~ step(X1,X2) ),
inference(fof_simplification,[status(thm)],[rewrite_right]) ).
cnf(c_0_27,plain,
( seq(succ(succ(succ(succ(succ(zero))))),f(f(f(X1,a),f(X2,a)),f(f(f(X3,a),X4),a)),X5)
| ~ step(f(f(f(f(f(X4,a),f(f(a,a),a)),X2),X3),X1),X6)
| ~ step(X6,X5) ),
inference(spm,[status(thm)],[c_0_8,c_0_25]) ).
cnf(c_0_28,plain,
( step(f(X3,X1),f(X3,X2))
| ~ step(X1,X2) ),
c_0_26 ).
cnf(c_0_29,negated_conjecture,
~ seq(succ(succ(succ(succ(succ(zero))))),X1,X1),
inference(fof_simplification,[status(thm)],[prove]) ).
cnf(c_0_30,plain,
( seq(succ(succ(succ(succ(succ(zero))))),f(f(f(X1,a),f(X2,a)),f(f(f(X3,a),X4),a)),X5)
| ~ step(f(f(f(f(f(X4,a),f(f(a,a),a)),X2),X3),X6),X5)
| ~ step(X1,X6) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
~ seq(succ(succ(succ(succ(succ(zero))))),X1,X1),
c_0_29 ).
cnf(c_0_32,plain,
( seq(succ(succ(succ(succ(succ(zero))))),f(f(f(X1,a),f(X2,a)),f(f(f(X3,a),X4),a)),f(X5,X6))
| ~ step(f(f(f(f(X4,a),f(f(a,a),a)),X2),X3),X5)
| ~ step(X1,X6) ),
inference(spm,[status(thm)],[c_0_30,c_0_14]) ).
cnf(c_0_33,negated_conjecture,
( ~ step(f(f(f(f(X1,a),f(f(a,a),a)),X2),X3),f(f(X4,a),f(X2,a)))
| ~ step(X4,f(f(f(X3,a),X1),a)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
( ~ step(f(f(f(X1,a),f(f(a,a),a)),X2),f(X3,a))
| ~ step(X3,f(f(f(f(X2,a),a),X1),a)) ),
inference(spm,[status(thm)],[c_0_33,c_0_14]) ).
cnf(c_0_35,negated_conjecture,
( ~ step(X1,f(f(f(f(a,a),a),X2),a))
| ~ step(f(f(X2,a),f(f(a,a),a)),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_14]) ).
cnf(c_0_36,negated_conjecture,
~ step(f(f(f(f(X1,a),a),a),f(f(a,a),a)),f(f(f(a,a),X1),f(f(f(a,a),a),a))),
inference(spm,[status(thm)],[c_0_35,c_0_18]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_36,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO691-1.001 : TPTP v8.2.0. Released v7.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 10:47:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 24.30/3.57 # Version: 3.1.0
% 24.30/3.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 24.30/3.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.30/3.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 24.30/3.57 # Starting new_bool_3 with 300s (1) cores
% 24.30/3.57 # Starting new_bool_1 with 300s (1) cores
% 24.30/3.57 # Starting sh5l with 300s (1) cores
% 24.30/3.57 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 8479 completed with status 0
% 24.30/3.57 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 24.30/3.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 24.30/3.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.30/3.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 24.30/3.57 # No SInE strategy applied
% 24.30/3.57 # Search class: FHUNS-FFSF21-MFFFFFNN
% 24.30/3.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 24.30/3.57 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 24.30/3.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 24.30/3.57 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 24.30/3.57 # Starting new_bool_3 with 136s (1) cores
% 24.30/3.57 # Starting new_bool_1 with 136s (1) cores
% 24.30/3.57 # H----_011_C07_F1_PI_SE_SP_S0V with pid 8487 completed with status 0
% 24.30/3.57 # Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 24.30/3.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 24.30/3.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.30/3.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 24.30/3.57 # No SInE strategy applied
% 24.30/3.57 # Search class: FHUNS-FFSF21-MFFFFFNN
% 24.30/3.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 24.30/3.57 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 24.30/3.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 24.30/3.57 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 24.30/3.57 # Preprocessing time : 0.001 s
% 24.30/3.57
% 24.30/3.57 # Proof found!
% 24.30/3.57 # SZS status Unsatisfiable
% 24.30/3.57 # SZS output start CNFRefutation
% See solution above
% 24.30/3.57 # Parsed axioms : 7
% 24.30/3.57 # Removed by relevancy pruning/SinE : 0
% 24.30/3.57 # Initial clauses : 7
% 24.30/3.57 # Removed in clause preprocessing : 0
% 24.30/3.57 # Initial clauses in saturation : 7
% 24.30/3.57 # Processed clauses : 10068
% 24.30/3.57 # ...of these trivial : 0
% 24.30/3.57 # ...subsumed : 1525
% 24.30/3.57 # ...remaining for further processing : 8543
% 24.30/3.57 # Other redundant clauses eliminated : 0
% 24.30/3.57 # Clauses deleted for lack of memory : 0
% 24.30/3.57 # Backward-subsumed : 25
% 24.30/3.57 # Backward-rewritten : 0
% 24.30/3.57 # Generated clauses : 18793
% 24.30/3.57 # ...of the previous two non-redundant : 18792
% 24.30/3.57 # ...aggressively subsumed : 0
% 24.30/3.57 # Contextual simplify-reflections : 0
% 24.30/3.57 # Paramodulations : 18793
% 24.30/3.57 # Factorizations : 0
% 24.30/3.57 # NegExts : 0
% 24.30/3.57 # Equation resolutions : 0
% 24.30/3.57 # Disequality decompositions : 0
% 24.30/3.57 # Total rewrite steps : 0
% 24.30/3.57 # ...of those cached : 0
% 24.30/3.57 # Propositional unsat checks : 0
% 24.30/3.57 # Propositional check models : 0
% 24.30/3.57 # Propositional check unsatisfiable : 0
% 24.30/3.57 # Propositional clauses : 0
% 24.30/3.57 # Propositional clauses after purity: 0
% 24.30/3.57 # Propositional unsat core size : 0
% 24.30/3.57 # Propositional preprocessing time : 0.000
% 24.30/3.57 # Propositional encoding time : 0.000
% 24.30/3.57 # Propositional solver time : 0.000
% 24.30/3.57 # Success case prop preproc time : 0.000
% 24.30/3.57 # Success case prop encoding time : 0.000
% 24.30/3.57 # Success case prop solver time : 0.000
% 24.30/3.57 # Current number of processed clauses : 8518
% 24.30/3.57 # Positive orientable unit clauses : 3
% 24.30/3.57 # Positive unorientable unit clauses: 0
% 24.30/3.57 # Negative unit clauses : 6
% 24.30/3.57 # Non-unit-clauses : 8509
% 24.30/3.57 # Current number of unprocessed clauses: 8731
% 24.30/3.57 # ...number of literals in the above : 35528
% 24.30/3.57 # Current number of archived formulas : 0
% 24.30/3.57 # Current number of archived clauses : 25
% 24.30/3.57 # Clause-clause subsumption calls (NU) : 12531120
% 24.30/3.57 # Rec. Clause-clause subsumption calls : 2548785
% 24.30/3.57 # Non-unit clause-clause subsumptions : 1550
% 24.30/3.57 # Unit Clause-clause subsumption calls : 42226
% 24.30/3.57 # Rewrite failures with RHS unbound : 0
% 24.30/3.57 # BW rewrite match attempts : 0
% 24.30/3.57 # BW rewrite match successes : 0
% 24.30/3.57 # Condensation attempts : 0
% 24.30/3.57 # Condensation successes : 0
% 24.30/3.57 # Termbank termtop insertions : 920415
% 24.30/3.57 # Search garbage collected termcells : 14
% 24.30/3.57
% 24.30/3.57 # -------------------------------------------------
% 24.30/3.57 # User time : 3.030 s
% 24.30/3.57 # System time : 0.041 s
% 24.30/3.57 # Total time : 3.070 s
% 24.30/3.57 # Maximum resident set size: 1640 pages
% 24.30/3.57
% 24.30/3.57 # -------------------------------------------------
% 24.30/3.57 # User time : 15.202 s
% 24.30/3.57 # System time : 0.109 s
% 24.30/3.57 # Total time : 15.311 s
% 24.30/3.57 # Maximum resident set size: 1696 pages
% 24.30/3.57 % E---3.1 exiting
%------------------------------------------------------------------------------