TSTP Solution File: SYO691-1.000 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYO691-1.000 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : Sat May 4 10:40:09 EDT 2024
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of clauses : 29 ( 10 unt; 0 nHn; 18 RR)
% Number of literals : 57 ( 0 equ; 33 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 78 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rewrite_sequence_succ,axiom,
( seq(succ(X1),X2,X4)
| ~ seq(X1,X2,X3)
| ~ step(X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.w4osKhBtnU/E---3.1_5893.p',rewrite_sequence_succ) ).
cnf(rewrite_sequence_zero,axiom,
seq(zero,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.w4osKhBtnU/E---3.1_5893.p',rewrite_sequence_zero) ).
cnf(rewrite_right,axiom,
( step(f(X3,X1),f(X3,X2))
| ~ step(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.w4osKhBtnU/E---3.1_5893.p',rewrite_right) ).
cnf(rewrite_left,axiom,
( step(f(X1,X3),f(X2,X3))
| ~ step(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.w4osKhBtnU/E---3.1_5893.p',rewrite_left) ).
cnf(rewrite_top,axiom,
( step(X1,X2)
| ~ top(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.w4osKhBtnU/E---3.1_5893.p',rewrite_top) ).
cnf(rule_1,axiom,
top(f(f(X1,X2),f(X3,a)),f(f(X3,f(X2,a)),X1)),
file('/export/starexec/sandbox2/tmp/tmp.w4osKhBtnU/E---3.1_5893.p',rule_1) ).
cnf(prove,negated_conjecture,
~ seq(succ(succ(succ(zero))),X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.w4osKhBtnU/E---3.1_5893.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(X3,X1),f(X3,X2))
| ~ step(X1,X2) ),
inference(fof_simplification,[status(thm)],[rewrite_right]) ).
cnf(c_0_12,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_13,plain,
( step(f(X3,X1),f(X3,X2))
| ~ step(X1,X2) ),
c_0_11 ).
cnf(c_0_14,plain,
( step(f(X1,X3),f(X2,X3))
| ~ step(X1,X2) ),
inference(fof_simplification,[status(thm)],[rewrite_left]) ).
cnf(c_0_15,plain,
( seq(succ(succ(zero)),X1,f(X2,X3))
| ~ step(X1,f(X2,X4))
| ~ step(X4,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( step(f(X1,X3),f(X2,X3))
| ~ step(X1,X2) ),
c_0_14 ).
cnf(c_0_17,plain,
( step(X1,X2)
| ~ top(X1,X2) ),
inference(fof_simplification,[status(thm)],[rewrite_top]) ).
cnf(c_0_18,plain,
( seq(succ(succ(zero)),f(X1,X2),f(X3,X4))
| ~ step(X2,X4)
| ~ step(X1,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( step(X1,X2)
| ~ top(X1,X2) ),
c_0_17 ).
cnf(c_0_20,axiom,
top(f(f(X1,X2),f(X3,a)),f(f(X3,f(X2,a)),X1)),
rule_1 ).
cnf(c_0_21,negated_conjecture,
~ seq(succ(succ(succ(zero))),X1,X1),
inference(fof_simplification,[status(thm)],[prove]) ).
cnf(c_0_22,plain,
( seq(succ(succ(succ(zero))),f(X1,X2),X3)
| ~ step(f(X4,X5),X3)
| ~ step(X2,X5)
| ~ step(X1,X4) ),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_23,plain,
step(f(f(X1,X2),f(X3,a)),f(f(X3,f(X2,a)),X1)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ seq(succ(succ(succ(zero))),X1,X1),
c_0_21 ).
cnf(c_0_25,plain,
( seq(succ(succ(succ(zero))),f(X1,X2),f(f(X3,f(X4,a)),X5))
| ~ step(X2,f(X3,a))
| ~ step(X1,f(X5,X4)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( ~ step(f(X1,f(X2,a)),f(X3,X2))
| ~ step(X3,f(X1,a)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
~ step(f(X1,f(X2,a)),f(f(X1,X2),a)),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_27,c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO691-1.000 : TPTP v8.1.2. Released v7.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n027.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 : Fri May 3 10:13:51 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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/tmp/tmp.w4osKhBtnU/E---3.1_5893.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # sh5l with pid 6073 completed with status 0
% 0.20/0.51 # Result found by sh5l
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FHUNS-FFSF21-MFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 163s (1) cores
% 0.20/0.51 # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 6081 completed with status 0
% 0.20/0.51 # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FHUNS-FFSF21-MFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 163s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 7
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 7
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 7
% 0.20/0.51 # Processed clauses : 58
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 3
% 0.20/0.51 # ...remaining for further processing : 55
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 88
% 0.20/0.51 # ...of the previous two non-redundant : 87
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 83
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 0
% 0.20/0.51 # ...of those cached : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 46
% 0.20/0.51 # Positive orientable unit clauses : 3
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 3
% 0.20/0.51 # Non-unit-clauses : 40
% 0.20/0.51 # Current number of unprocessed clauses: 43
% 0.20/0.51 # ...number of literals in the above : 133
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 7
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 940
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 789
% 0.20/0.51 # Non-unit clause-clause subsumptions : 3
% 0.20/0.51 # Unit Clause-clause subsumption calls : 84
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 2392
% 0.20/0.51 # Search garbage collected termcells : 14
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.007 s
% 0.20/0.51 # System time : 0.001 s
% 0.20/0.51 # Total time : 0.009 s
% 0.20/0.51 # Maximum resident set size: 1608 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.007 s
% 0.20/0.51 # System time : 0.005 s
% 0.20/0.51 # Total time : 0.012 s
% 0.20/0.51 # Maximum resident set size: 1700 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------