%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYO038-1.003.003 : TPTP v9.2.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 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 5 05:52:48 PM UTC 2026
% Result : Unsatisfiable 1.12s 1.61s
% Output : CNFRefutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of clauses : 38 ( 32 unt; 0 nHn; 29 RR)
% Number of literals : 44 ( 14 equ; 21 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 16 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ax3,axiom,
f(s(X1),s(X2)) = f(X1,f(s(X1),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
cnf(ax1,axiom,
f(X1,one) = s(one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
cnf(ax5,axiom,
( d(s(X1))
| ~ d(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
cnf(ax2,axiom,
f(one,s(X1)) = s(s(f(one,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
cnf(conj,negated_conjecture,
~ d(f(s(s(one)),s(s(one)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
cnf(ax4,axiom,
d(one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
cnf(c_0_6,axiom,
f(s(X1),s(X2)) = f(X1,f(s(X1),X2)),
ax3 ).
cnf(c_0_7,axiom,
f(X1,one) = s(one),
ax1 ).
cnf(c_0_8,plain,
f(s(X1),s(one)) = f(X1,s(one)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
( d(s(X1))
| ~ d(X1) ),
ax5 ).
cnf(c_0_10,axiom,
f(one,s(X1)) = s(s(f(one,X1))),
ax2 ).
cnf(c_0_11,plain,
f(X1,f(X1,s(one))) = f(s(X1),s(s(one))),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_12,plain,
( d(f(one,s(X1)))
| ~ d(s(f(one,X1))) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
f(one,s(one)) = s(s(s(one))),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_14,plain,
f(s(X1),f(X1,s(one))) = f(s(s(X1)),s(s(one))),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_15,plain,
( d(f(one,f(one,s(X1))))
| ~ d(s(f(one,s(f(one,X1))))) ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_16,plain,
f(s(one),s(s(one))) = f(one,s(s(s(one)))),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ d(f(s(s(one)),s(s(one)))),
conj ).
cnf(c_0_18,plain,
f(s(s(one)),s(s(one))) = f(s(one),s(s(s(one)))),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_19,plain,
( d(f(one,f(one,s(X1))))
| ~ d(f(one,s(f(one,X1)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_20,plain,
f(one,f(one,s(s(s(one))))) = f(s(one),s(s(s(one)))),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_21,plain,
f(one,s(s(one))) = s(s(s(s(s(one))))),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_22,negated_conjecture,
~ d(f(s(one),s(s(s(one))))),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
~ d(f(one,s(s(s(s(s(s(one)))))))),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_24,plain,
~ d(s(f(one,s(s(s(s(s(one)))))))),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_25,plain,
~ d(f(one,s(s(s(s(s(one))))))),
inference(spm,[status(thm)],[c_0_24,c_0_9]) ).
cnf(c_0_26,plain,
~ d(s(f(one,s(s(s(s(one))))))),
inference(spm,[status(thm)],[c_0_25,c_0_12]) ).
cnf(c_0_27,plain,
~ d(f(one,s(s(s(s(one)))))),
inference(spm,[status(thm)],[c_0_26,c_0_9]) ).
cnf(c_0_28,plain,
~ d(s(f(one,s(s(s(one)))))),
inference(spm,[status(thm)],[c_0_27,c_0_12]) ).
cnf(c_0_29,plain,
~ d(f(one,s(s(s(one))))),
inference(spm,[status(thm)],[c_0_28,c_0_9]) ).
cnf(c_0_30,plain,
( d(f(one,s(s(s(one)))))
| ~ d(s(s(s(s(s(one)))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_7]),c_0_21]) ).
cnf(c_0_31,plain,
~ d(s(s(s(s(s(one)))))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
~ d(s(s(s(s(one))))),
inference(spm,[status(thm)],[c_0_31,c_0_9]) ).
cnf(c_0_33,plain,
~ d(s(s(s(one)))),
inference(spm,[status(thm)],[c_0_32,c_0_9]) ).
cnf(c_0_34,plain,
~ d(s(s(one))),
inference(spm,[status(thm)],[c_0_33,c_0_9]) ).
cnf(c_0_35,plain,
~ d(s(one)),
inference(spm,[status(thm)],[c_0_34,c_0_9]) ).
cnf(c_0_36,axiom,
d(one),
ax4 ).
cnf(c_0_37,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_9]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SYO038-1.003.003 : TPTP v9.2.1. Released v5.3.0.
% 0.00/0.06 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.06/0.24 % Computer : n012.cluster.edu
% 0.06/0.24 % Model : x86_64 x86_64
% 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24 % Memory : 8042.1875MB
% 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24 % CPULimit : 300
% 0.06/0.24 % WCLimit : 300
% 0.06/0.24 % DateTime : Tue May 5 08:53:30 EDT 2026
% 0.06/0.24 % CPUTime :
% 0.06/0.25 % start to proof: theBenchmark
% 1.12/1.61 % Version : CSE_E---1.7
% 1.12/1.61 % Problem : theBenchmark.p
% 1.12/1.61 % SZS status Unsatisfiable for theBenchmark.p
% 1.12/1.61 % SZS output start CNFRefutation
% See solution above
% 1.12/1.61 % Total time : 1.362s
%------------------------------------------------------------------------------