%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV021-1 : TPTP v9.2.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n026.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:20:38 PM UTC 2026
% Result : Satisfiable 1.25s 1.71s
% Output : Saturation 1.25s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(consistency_of_add_commutative,negated_conjecture,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',consistency_of_add_commutative) ).
cnf(definition_add_s,axiom,
add(s(X1),X2) = s(add(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_add_s) ).
cnf(definition_add_0,axiom,
add(n0,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_add_0) ).
cnf(successor_is_injective,axiom,
( X1 = X2
| s(X1) != s(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_is_injective) ).
cnf(zero_is_not_s,axiom,
n0 != s(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_is_not_s) ).
cnf(c_0_5,negated_conjecture,
add(X1,X2) = add(X2,X1),
consistency_of_add_commutative,
[final] ).
cnf(c_0_6,axiom,
add(s(X1),X2) = s(add(X1,X2)),
definition_add_s,
[final] ).
cnf(c_0_7,axiom,
add(n0,X1) = X1,
definition_add_0,
[final] ).
cnf(c_0_8,axiom,
( X1 = X2
| s(X1) != s(X2) ),
successor_is_injective,
[final] ).
cnf(c_0_9,axiom,
n0 != s(X1),
zero_is_not_s,
[final] ).
cnf(c_0_10,negated_conjecture,
add(X1,s(X2)) = s(add(X2,X1)),
inference(spm,[status(thm)],[c_0_5,c_0_6]),
[final] ).
cnf(c_0_11,negated_conjecture,
add(X1,n0) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_5]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV021-1 : TPTP v9.2.1. Released v2.7.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n026.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 04:54:08 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.25/1.71 % Version : CSE_E---1.7
% 1.25/1.71 % Problem : theBenchmark.p
% 1.25/1.71 % SZS status Satisfiable for theBenchmark.p
% 1.25/1.71 % SZS output start Saturation
% See solution above
% 1.25/1.71 % Total time : 1.369s
%------------------------------------------------------------------------------