↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : CSR016+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 : n026.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 30.62s 4.65s
% Output   : CNFRefutation 30.62s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR016+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.09/0.35  % Computer : n026.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 26 23:58:25 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.12/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 30.62/4.65  % SZS status Theorem for theBenchmark.p
% 30.62/4.65  % SZS output start CNFRefutation for theBenchmark.p
% 30.62/4.65  fof(plus0_1, axiom, plus(n0,n1) = n1).
% 30.62/4.65  fof(symmetry_of_plus, axiom, ! [X0] : ! [X1] : plus(X0,X1) = plus(X1,X0)).
% 30.62/4.65  fof(less_or_equal, axiom, ! [X0] : ! [X1] : (('less$uor$uequal'(X0,X1) <=> (less(X0,X1) | X0 = X1)))).
% 30.62/4.65  fof(less0, axiom, ~? [X0] : less(X0,n0)).
% 30.62/4.65  fof(less2, axiom, ! [X0] : ((less(X0,n2) <=> 'less$uor$uequal'(X0,n1)))).
% 30.62/4.65  fof(not_splinning_0, hypothesis, ~holdsAt(spinning,n0)).
% 30.62/4.65  fof(happens_holds, axiom, ! [X0] : ! [X1] : ! [X2] : (((happens(X0,X1) & initiates(X0,X2,X1)) => holdsAt(X2,plus(X1,n1))))).
% 30.62/4.65  fof(initiates_all_defn, axiom, ! [X0] : ! [X1] : ! [X2] : ((initiates(X0,X1,X2) <=> ((X0 = push & (X1 = forwards & ~happens(pull,X2))) | ((X0 = pull & (X1 = backwards & ~happens(push,X2))) | (X0 = pull & (X1 = spinning & happens(push,X2)))))))).
% 30.62/4.65  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))))))).
% 30.62/4.65  fof(push_not_pull, axiom, push != pull).
% 30.62/4.65  fof(forwards_1, conjecture, holdsAt(forwards,n1)).
% 30.62/4.65  fof(negated_conjecture, negated_conjecture, ~holdsAt(forwards,n1), inference(negate_conjecture, [status(cth)], [forwards_1])).
% 30.62/4.65  cnf(c1, plain, plus(n0,n1) = n1, inference(clausification, [status(esa)], [plus0_1])).
% 30.62/4.65  cnf(c10, plain, plus(X0,X1) = plus(X1,X0), inference(clausification, [status(esa)], [symmetry_of_plus])).
% 30.62/4.65  cnf(c13, plain, 'less$uor$uequal'(X0,X1) | X0 != X1, inference(clausification, [status(esa)], [less_or_equal])).
% 30.62/4.65  cnf(c14, plain, ~less(X0,n0), inference(clausification, [status(esa)], [less0])).
% 30.62/4.65  cnf(c18, plain, less(X0,n2) | ~'less$uor$uequal'(X0,n1), inference(clausification, [status(esa)], [less2])).
% 30.62/4.65  cnf(c38, plain, ~holdsAt(spinning,n0), inference(clausification, [status(esa)], [not_splinning_0])).
% 30.62/4.65  cnf(c64, plain, ~happens(X0,X1) | ~initiates(X0,X2,X1) | holdsAt(X2,plus(X1,n1)), inference(clausification, [status(esa)], [happens_holds])).
% 30.62/4.65  cnf(c70, plain, initiates(X0,X1,X2) | ~X3(X0,X1,X2), inference(clausification, [status(esa)], [initiates_all_defn])).
% 30.62/4.65  cnf(c78, plain, X0(X1,X2,X3) | X1 != push | X2 != forwards | happens(pull,X3), inference(clausification, [status(esa)], [initiates_all_defn])).
% 30.62/4.65  cnf(c82, plain, X0(X1,X2,X3) | ~X4(X1,X2,X3), inference(clausification, [status(esa)], [initiates_all_defn])).
% 30.62/4.65  cnf(c84, plain, X0(X1,X2,X3) | X1 != pull | X2 != spinning | ~happens(push,X3), inference(clausification, [status(esa)], [initiates_all_defn])).
% 30.62/4.65  cnf(c117, plain, ~happens(X0,X1) | X2(X0,X1), inference(clausification, [status(esa)], [happens_all_defn])).
% 30.62/4.65  cnf(c118, plain, happens(X0,X1) | ~X2(X0,X1), inference(clausification, [status(esa)], [happens_all_defn])).
% 30.62/4.65  cnf(c122, plain, ~X0(X1,X2) | X2 = n2, inference(clausification, [status(esa)], [happens_all_defn])).
% 30.62/4.65  cnf(c126, plain, ~X0(X1,X2) | X1 = push | X2 = n1 | X3(X1,X2), inference(clausification, [status(esa)], [happens_all_defn])).
% 30.62/4.65  cnf(c129, plain, X0(X1,X2) | X1 != push | X2 != n0, inference(clausification, [status(esa)], [happens_all_defn])).
% 30.62/4.65  cnf(c132, plain, push != pull, inference(clausification, [status(esa)], [push_not_pull])).
% 30.62/4.65  cnf(c136, plain, ~holdsAt(forwards,n1), inference(clausification, [status(esa)], [negated_conjecture])).
% 30.62/4.65  cnf(d0, plain, 'less$uor$uequal'(X0,X0), inference(equality_resolution, [status(thm)], [c13])).
% 30.62/4.65  cnf(d1, plain, less(n1,n2), inference(resolution, [status(thm)], [c18,d0])).
% 30.62/4.65  cnf(d2, plain, X0 != push | happens(pull,X1) | 'Ts69'(X0,forwards,X1), inference(equality_resolution, [status(thm)], [c78])).
% 30.62/4.65  cnf(d3, plain, happens(pull,X0) | 'Ts69'(push,forwards,X0), inference(equality_resolution, [status(thm)], [d2])).
% 30.62/4.65  cnf(d4, plain, happens(pull,X0) | 'Ts70'(push,forwards,X0), inference(resolution, [status(thm)], [d3,c82])).
% 30.62/4.65  cnf(d5, plain, happens(pull,X0) | initiates(push,forwards,X0), inference(resolution, [status(thm)], [d4,c70])).
% 30.62/4.65  cnf(d6, plain, holdsAt(X1,plus(n1,X0)) | ~happens(X2,X0) | ~initiates(X2,X1,X0), inference(superposition, [status(thm)], [c10,c64])).
% 30.62/4.65  cnf(d7, plain, plus(n1,n0) = n1, inference(demodulation, [status(thm)], [c1,c10])).
% 30.62/4.65  cnf(d8, plain, holdsAt(X0,n1) | ~happens(X1,n0) | ~initiates(X1,X0,n0), inference(superposition, [status(thm)], [d7,d6])).
% 30.62/4.65  cnf(d9, plain, holdsAt(forwards,n1) | ~happens(push,n0) | happens(pull,n0), inference(resolution, [status(thm)], [d8,d5])).
% 30.62/4.65  cnf(d10, plain, happens(pull,n0) | ~happens(push,n0), inference(resolution, [status(thm)], [c136,d9])).
% 30.62/4.65  cnf(d11, plain, X0 != n0 | 'Ts87'(push,X0), inference(equality_resolution, [status(thm)], [c129])).
% 30.62/4.65  cnf(d12, plain, 'Ts87'(push,n0), inference(equality_resolution, [status(thm)], [d11])).
% 30.62/4.65  cnf(d13, plain, happens(push,n0), inference(resolution, [status(thm)], [d12,c118])).
% 30.62/4.65  cnf(d14, plain, happens(pull,n0), inference(resolution, [status(thm)], [d13,d10])).
% 30.62/4.65  cnf(d15, plain, 'Ts87'(pull,n0), inference(resolution, [status(thm)], [d14,c117])).
% 30.62/4.65  cnf(d16, plain, n0 = n1 | pull = push | 'Ts86'(pull,n0), inference(resolution, [status(thm)], [d15,c126])).
% 30.62/4.65  cnf(d17, plain, n0 = n1 | pull = push | n0 = n2, inference(resolution, [status(thm)], [d16,c122])).
% 30.62/4.65  cnf(d18, plain, pull != pull | n0 = n1 | n0 = n2, inference(superposition, [status(thm)], [d17,c132])).
% 30.62/4.65  cnf(d19, plain, n0 = n1 | n0 = n2, inference(equality_resolution, [status(thm)], [d18])).
% 30.62/4.65  cnf(d20, plain, less(n1,n0) | n0 = n1, inference(superposition, [status(thm)], [d19,d1])).
% 30.62/4.65  cnf(d21, plain, n0 = n1, inference(resolution, [status(thm)], [c14,d20])).
% 30.62/4.65  cnf(d22, plain, ~holdsAt(spinning,n1), inference(demodulation, [status(thm)], [c38,d21])).
% 30.62/4.65  cnf(d23, plain, X0 != pull | ~happens(push,X1) | 'Ts70'(X0,spinning,X1), inference(equality_resolution, [status(thm)], [c84])).
% 30.62/4.65  cnf(d24, plain, ~happens(push,X0) | 'Ts70'(pull,spinning,X0), inference(equality_resolution, [status(thm)], [d23])).
% 30.62/4.65  cnf(d25, plain, ~happens(push,X0) | initiates(pull,spinning,X0), inference(resolution, [status(thm)], [d24,c70])).
% 30.62/4.65  cnf(d26, plain, holdsAt(spinning,n1) | ~happens(pull,n0) | ~happens(push,n0), inference(resolution, [status(thm)], [d8,d25])).
% 30.62/4.65  cnf(d27, plain, holdsAt(spinning,n1) | ~happens(pull,n0), inference(resolution, [status(thm)], [d13,d26])).
% 30.62/4.65  cnf(d28, plain, holdsAt(spinning,n1), inference(resolution, [status(thm)], [d14,d27])).
% 30.62/4.65  cnf(d29, plain, $false, inference(resolution, [status(thm)], [d28,d22])).
% 30.62/4.65  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------