%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : CSR017+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:03:42 AM UTC 2026
% Result : Theorem 21.82s 4.13s
% Output : CNFRefutation 21.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR017+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n015.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 23:58:59 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.82/4.13 % SZS status Theorem for theBenchmark.p
% 21.82/4.13 % SZS output start CNFRefutation for theBenchmark.p
% 21.82/4.13 fof(plus0_1, axiom, plus(n0,n1) = n1).
% 21.82/4.13 fof(symmetry_of_plus, axiom, ! [X0] : ! [X1] : plus(X0,X1) = plus(X1,X0)).
% 21.82/4.13 fof(less_or_equal, axiom, ! [X0] : ! [X1] : (('less$uor$uequal'(X0,X1) <=> (less(X0,X1) | X0 = X1)))).
% 21.82/4.13 fof(less0, axiom, ~? [X0] : less(X0,n0)).
% 21.82/4.13 fof(less2, axiom, ! [X0] : ((less(X0,n2) <=> 'less$uor$uequal'(X0,n1)))).
% 21.82/4.13 fof(not_splinning_0, hypothesis, ~holdsAt(spinning,n0)).
% 21.82/4.13 fof(happens_terminates_not_holds, axiom, ! [X0] : ! [X1] : ! [X2] : (((happens(X0,X1) & terminates(X0,X2,X1)) => ~holdsAt(X2,plus(X1,n1))))).
% 21.82/4.13 fof(terminates_all_defn, axiom, ! [X0] : ! [X1] : ! [X2] : ((terminates(X0,X1,X2) <=> ((X0 = push & (X1 = backwards & ~happens(pull,X2))) | ((X0 = pull & (X1 = forwards & ~happens(push,X2))) | ((X0 = pull & (X1 = forwards & happens(push,X2))) | ((X0 = pull & (X1 = backwards & happens(push,X2))) | ((X0 = push & (X1 = spinning & ~happens(pull,X2))) | (X0 = pull & (X1 = spinning & ~happens(push,X2))))))))))).
% 21.82/4.13 fof(happens_all_defn, axiom, ! [X0] : ! [X1] : ((happens(X0,X1) <=> ((X0 = push & X1 = n0) | ((X0 = pull & X1 = n1) | ((X0 = pull & X1 = n2) | (X0 = push & X1 = n2))))))).
% 21.82/4.13 fof(push_not_pull, axiom, push != pull).
% 21.82/4.13 fof(not_spinning_1, conjecture, ~holdsAt(spinning,n1)).
% 21.82/4.13 fof(negated_conjecture, negated_conjecture, ~~holdsAt(spinning,n1), inference(negate_conjecture, [status(cth)], [not_spinning_1])).
% 21.82/4.13 cnf(c1, plain, plus(n0,n1) = n1, inference(clausification, [status(esa)], [plus0_1])).
% 21.82/4.13 cnf(c10, plain, plus(X0,X1) = plus(X1,X0), inference(clausification, [status(esa)], [symmetry_of_plus])).
% 21.82/4.13 cnf(c13, plain, 'less$uor$uequal'(X0,X1) | X0 != X1, inference(clausification, [status(esa)], [less_or_equal])).
% 21.82/4.13 cnf(c14, plain, ~less(X0,n0), inference(clausification, [status(esa)], [less0])).
% 21.82/4.13 cnf(c18, plain, less(X0,n2) | ~'less$uor$uequal'(X0,n1), inference(clausification, [status(esa)], [less2])).
% 21.82/4.13 cnf(c38, plain, ~holdsAt(spinning,n0), inference(clausification, [status(esa)], [not_splinning_0])).
% 21.82/4.13 cnf(c65, plain, ~happens(X0,X1) | ~terminates(X0,X2,X1) | ~holdsAt(X2,plus(X1,n1)), inference(clausification, [status(esa)], [happens_terminates_not_holds])).
% 21.82/4.13 cnf(c86, plain, terminates(X0,X1,X2) | ~X3(X0,X1,X2), inference(clausification, [status(esa)], [terminates_all_defn])).
% 21.82/4.13 cnf(c90, plain, X0(X1,X2,X3) | X1 != push | X2 != spinning | happens(pull,X3), inference(clausification, [status(esa)], [terminates_all_defn])).
% 21.82/4.13 cnf(c114, plain, X0(X1,X2,X3) | ~X4(X1,X2,X3), inference(clausification, [status(esa)], [terminates_all_defn])).
% 21.82/4.13 cnf(c117, plain, ~happens(X0,X1) | X2(X0,X1), inference(clausification, [status(esa)], [happens_all_defn])).
% 21.82/4.13 cnf(c118, plain, happens(X0,X1) | ~X2(X0,X1), inference(clausification, [status(esa)], [happens_all_defn])).
% 21.82/4.13 cnf(c122, plain, ~X0(X1,X2) | X2 = n2, inference(clausification, [status(esa)], [happens_all_defn])).
% 21.82/4.13 cnf(c126, plain, ~X0(X1,X2) | X1 = push | X2 = n1 | X3(X1,X2), inference(clausification, [status(esa)], [happens_all_defn])).
% 21.82/4.13 cnf(c129, plain, X0(X1,X2) | X1 != push | X2 != n0, inference(clausification, [status(esa)], [happens_all_defn])).
% 21.82/4.13 cnf(c132, plain, push != pull, inference(clausification, [status(esa)], [push_not_pull])).
% 21.82/4.13 cnf(c136, plain, holdsAt(spinning,n1), inference(clausification, [status(esa)], [negated_conjecture])).
% 21.82/4.13 cnf(d0, plain, 'less$uor$uequal'(X0,X0), inference(equality_resolution, [status(thm)], [c13])).
% 21.82/4.13 cnf(d1, plain, less(n1,n2), inference(resolution, [status(thm)], [c18,d0])).
% 21.82/4.13 cnf(d2, plain, ~holdsAt(X1,plus(n1,X0)) | ~happens(X2,X0) | ~terminates(X2,X1,X0), inference(superposition, [status(thm)], [c10,c65])).
% 21.82/4.13 cnf(d3, plain, plus(n1,n0) = n1, inference(demodulation, [status(thm)], [c1,c10])).
% 21.82/4.13 cnf(d4, plain, ~holdsAt(X0,n1) | ~happens(X1,n0) | ~terminates(X1,X0,n0), inference(superposition, [status(thm)], [d3,d2])).
% 21.82/4.13 cnf(d5, plain, X0 != push | happens(pull,X1) | 'Ts74'(X0,spinning,X1), inference(equality_resolution, [status(thm)], [c90])).
% 21.82/4.13 cnf(d6, plain, happens(pull,X0) | 'Ts74'(push,spinning,X0), inference(equality_resolution, [status(thm)], [d5])).
% 21.82/4.13 cnf(d7, plain, happens(pull,X0) | 'Ts79'(push,spinning,X0), inference(resolution, [status(thm)], [d6,c114])).
% 21.82/4.13 cnf(d8, plain, happens(pull,X0) | terminates(push,spinning,X0), inference(resolution, [status(thm)], [d7,c86])).
% 21.82/4.13 cnf(d9, plain, happens(pull,n0) | ~holdsAt(spinning,n1) | ~happens(push,n0), inference(resolution, [status(thm)], [d8,d4])).
% 21.82/4.13 cnf(d10, plain, happens(pull,n0) | ~happens(push,n0), inference(resolution, [status(thm)], [c136,d9])).
% 21.82/4.13 cnf(d11, plain, X0 != n0 | 'Ts87'(push,X0), inference(equality_resolution, [status(thm)], [c129])).
% 21.82/4.13 cnf(d12, plain, 'Ts87'(push,n0), inference(equality_resolution, [status(thm)], [d11])).
% 21.82/4.13 cnf(d13, plain, happens(push,n0), inference(resolution, [status(thm)], [d12,c118])).
% 21.82/4.13 cnf(d14, plain, happens(pull,n0), inference(resolution, [status(thm)], [d13,d10])).
% 21.82/4.13 cnf(d15, plain, 'Ts87'(pull,n0), inference(resolution, [status(thm)], [d14,c117])).
% 21.82/4.13 cnf(d16, plain, n0 = n1 | pull = push | 'Ts86'(pull,n0), inference(resolution, [status(thm)], [d15,c126])).
% 21.82/4.13 cnf(d17, plain, n0 = n1 | pull = push | n0 = n2, inference(resolution, [status(thm)], [d16,c122])).
% 21.82/4.13 cnf(d18, plain, less(n1,n0) | n0 = n1 | pull = push, inference(superposition, [status(thm)], [d17,d1])).
% 21.82/4.13 cnf(d19, plain, n0 = n1 | pull = push, inference(resolution, [status(thm)], [c14,d18])).
% 21.82/4.13 cnf(d20, plain, ~holdsAt(spinning,n1) | pull = push, inference(superposition, [status(thm)], [d19,c38])).
% 21.82/4.13 cnf(d21, plain, pull = push, inference(resolution, [status(thm)], [c136,d20])).
% 21.82/4.13 cnf(d22, plain, pull != pull, inference(demodulation, [status(thm)], [c132,d21])).
% 21.82/4.13 cnf(d23, plain, $false, inference(equality_resolution, [status(thm)], [d22])).
% 21.82/4.13 % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------