↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWC343+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n016.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 08:55:02 AM UTC 2026

% Result   : Theorem 21.05s 11.93s
% Output   : CNFRefutation 21.05s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SWC343+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/5.43  % Computer : n016.cluster.edu
% 0.16/5.43  % Model    : x86_64 x86_64
% 0.16/5.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.43  % Memory   : 8046.5625MB
% 0.16/5.43  % OS       : Linux 6.8.0-71-generic
% 0.16/5.43  % CPULimit : 300
% 0.16/5.43  % WCLimit  : 300
% 0.16/5.43  % DateTime : Sat Sep 26 12:55:51 UTC 2026
% 0.16/5.44  % CPUTime  : 
% 0.16/5.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.05/11.93  % SZS status Theorem for theBenchmark.p
% 21.05/11.93  % SZS output start CNFRefutation for theBenchmark.p
% 21.05/11.93  fof(co1, conjecture, ! [X0] : ((ssList(X0) => ! [X1] : ((ssList(X1) => ! [X2] : ((ssList(X2) => ! [X3] : ((ssList(X3) => (X1 != X3 | (X0 != X2 | (! [X4] : ((ssList(X4) => (app(X2,X4) != X3 | (~strictorderedP(X2) | ? [X5] : ((ssItem(X5) & ? [X6] : ((ssList(X6) & (app(cons(X5,nil),X6) = X4 & ? [X7] : ((ssItem(X7) & ? [X8] : ((ssList(X8) & (app(X8,cons(X7,nil)) = X2 & lt(X7,X5))))))))))))))) | ((nil != X3 & nil = X2) | (? [X9] : ((ssList(X9) & (app(X0,X9) = X1 & (! [X10] : ((ssItem(X10) => ! [X11] : ((ssList(X11) => (app(cons(X10,nil),X11) != X9 | ! [X12] : ((ssItem(X12) => ! [X13] : ((ssList(X13) => (app(X13,cons(X12,nil)) != X0 | ~lt(X12,X10))))))))))) & strictorderedP(X0))))) & (nil != X0 | nil = X1))))))))))))))).
% 21.05/11.93  fof(negated_conjecture, negated_conjecture, ~! [X0] : ((ssList(X0) => ! [X1] : ((ssList(X1) => ! [X2] : ((ssList(X2) => ! [X3] : ((ssList(X3) => (X1 != X3 | (X0 != X2 | (! [X4] : ((ssList(X4) => (app(X2,X4) != X3 | (~strictorderedP(X2) | ? [X5] : ((ssItem(X5) & ? [X6] : ((ssList(X6) & (app(cons(X5,nil),X6) = X4 & ? [X7] : ((ssItem(X7) & ? [X8] : ((ssList(X8) & (app(X8,cons(X7,nil)) = X2 & lt(X7,X5))))))))))))))) | ((nil != X3 & nil = X2) | (? [X9] : ((ssList(X9) & (app(X0,X9) = X1 & (! [X10] : ((ssItem(X10) => ! [X11] : ((ssList(X11) => (app(cons(X10,nil),X11) != X9 | ! [X12] : ((ssItem(X12) => ! [X13] : ((ssList(X13) => (app(X13,cons(X12,nil)) != X0 | ~lt(X12,X10))))))))))) & strictorderedP(X0))))) & (nil != X0 | nil = X1)))))))))))))), inference(negate_conjecture, [status(cth)], [co1])).
% 21.05/11.93  cnf(c212, plain, sK255 = sK257, inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c213, plain, sK254 = sK256, inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c214, plain, ssList(sK258), inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c215, plain, app(sK256,sK258) = sK257, inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c216, plain, strictorderedP(sK256), inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c217, plain, app(X0,cons(X1,nil)) != sK256 | ~ssItem(X2) | app(cons(X2,nil),X3) != sK258 | ~lt(X1,X2) | ~ssList(X3) | ~ssList(X0) | ~ssItem(X1), inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c218, plain, nil = sK257 | nil != sK256, inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c219, plain, ~ssList(X0) | nil = sK254 | ~strictorderedP(sK254) | app(sK254,X0) != sK255 | ~X1(sK254,X0), inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c220, plain, nil != sK255 | ~ssList(X0) | ~strictorderedP(sK254) | app(sK254,X0) != sK255 | ~X1(sK254,X0), inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c221, plain, X0(X1,X2) | ssItem(sK264(X1,X2)), inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c222, plain, X0(X1,X2) | ssList(sK265(X1,X2)), inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c223, plain, X0(X1,X2) | app(cons(sK264(X1,X2),nil),sK265(X1,X2)) = X2, inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c224, plain, X0(X1,X2) | ssItem(sK266(X1,X2)), inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c225, plain, X0(X1,X2) | ssList(sK267(X1,X2)), inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c226, plain, X0(X1,X2) | app(sK267(X1,X2),cons(sK266(X1,X2),nil)) = X1, inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(c227, plain, X0(X1,X2) | lt(sK266(X1,X2),sK264(X1,X2)), inference(clausification, [status(esa)], [negated_conjecture])).
% 21.05/11.93  cnf(d0, plain, nil != sK254 | nil = sK257, inference(demodulation, [status(thm)], [c218,c213])).
% 21.05/11.93  cnf(d1, plain, nil != sK254 | nil = sK255, inference(demodulation, [status(thm)], [d0,c212])).
% 21.05/11.93  cnf(d2, plain, strictorderedP(sK254), inference(demodulation, [status(thm)], [c216,c213])).
% 21.05/11.93  cnf(d3, plain, app(sK254,X0) != sK255 | nil = sK254 | ~ssList(X0) | ~'Ts253'(sK254,X0), inference(resolution, [status(thm)], [d2,c219])).
% 21.05/11.93  cnf(d4, plain, app(sK254,sK258) = sK257, inference(demodulation, [status(thm)], [c215,c213])).
% 21.05/11.93  cnf(d5, plain, app(sK254,sK258) = sK255, inference(demodulation, [status(thm)], [d4,c212])).
% 21.05/11.93  cnf(d6, plain, sK255 != sK255 | nil = sK254 | ~ssList(sK258) | ~'Ts253'(sK254,sK258), inference(superposition, [status(thm)], [d5,d3])).
% 21.05/11.93  cnf(d7, plain, nil = sK254 | sK255 != sK255 | ~'Ts253'(sK254,sK258), inference(resolution, [status(thm)], [c214,d6])).
% 21.05/11.93  cnf(d8, plain, nil = sK254 | ~'Ts253'(sK254,sK258), inference(equality_resolution, [status(thm)], [d7])).
% 21.05/11.93  cnf(d9, plain, app(X0,cons(X1,nil)) != sK254 | app(cons(X2,nil),X3) != sK258 | ~ssItem(X2) | ~ssItem(X1) | ~ssList(X3) | ~ssList(X0) | ~lt(X1,X2), inference(demodulation, [status(thm)], [c217,c213])).
% 21.05/11.93  cnf(d10, plain, X1 != sK258 | app(X2,cons(X3,nil)) != sK254 | ~ssItem(sK264(X0,X1)) | ~ssItem(X3) | ~ssList(sK265(X0,X1)) | ~ssList(X2) | ~lt(X3,sK264(X0,X1)) | 'Ts253'(X0,X1), inference(superposition, [status(thm)], [c223,d9])).
% 21.05/11.93  cnf(d11, plain, X0 != sK254 | X2 != sK258 | ~ssItem(sK266(X0,X1)) | ~ssItem(sK264(X3,X2)) | ~ssList(sK267(X0,X1)) | ~ssList(sK265(X3,X2)) | ~lt(sK266(X0,X1),sK264(X3,X2)) | 'Ts253'(X3,X2) | 'Ts253'(X0,X1), inference(superposition, [status(thm)], [c226,d10])).
% 21.05/11.93  cnf(d12, plain, X0 != sK258 | ~ssItem(sK264(X1,X0)) | ~ssItem(sK266(sK254,X2)) | ~ssList(sK265(X1,X0)) | ~ssList(sK267(sK254,X2)) | ~lt(sK266(sK254,X2),sK264(X1,X0)) | 'Ts253'(X1,X0) | 'Ts253'(sK254,X2), inference(equality_resolution, [status(thm)], [d11])).
% 21.05/11.93  cnf(d13, plain, ~ssItem(sK264(X0,sK258)) | ~ssItem(sK266(sK254,X1)) | ~ssList(sK265(X0,sK258)) | ~ssList(sK267(sK254,X1)) | ~lt(sK266(sK254,X1),sK264(X0,sK258)) | 'Ts253'(X0,sK258) | 'Ts253'(sK254,X1), inference(equality_resolution, [status(thm)], [d12])).
% 21.05/11.93  cnf(d14, plain, ~ssItem(sK264(sK254,sK258)) | ~ssItem(sK266(sK254,sK258)) | ~ssList(sK265(sK254,sK258)) | ~ssList(sK267(sK254,sK258)) | 'Ts253'(sK254,sK258) | 'Ts253'(sK254,sK258) | 'Ts253'(sK254,sK258), inference(resolution, [status(thm)], [d13,c227])).
% 21.05/11.93  cnf(d15, plain, ~ssItem(sK264(sK254,sK258)) | ~ssItem(sK266(sK254,sK258)) | ~ssList(sK265(sK254,sK258)) | 'Ts253'(sK254,sK258) | 'Ts253'(sK254,sK258), inference(resolution, [status(thm)], [d14,c225])).
% 21.05/11.93  cnf(d16, plain, ~ssItem(sK264(sK254,sK258)) | ~ssItem(sK266(sK254,sK258)) | 'Ts253'(sK254,sK258) | 'Ts253'(sK254,sK258), inference(resolution, [status(thm)], [d15,c222])).
% 21.05/11.93  cnf(d17, plain, ~ssItem(sK264(sK254,sK258)) | 'Ts253'(sK254,sK258) | 'Ts253'(sK254,sK258), inference(resolution, [status(thm)], [d16,c224])).
% 21.05/11.93  cnf(d18, plain, 'Ts253'(sK254,sK258) | 'Ts253'(sK254,sK258), inference(resolution, [status(thm)], [d17,c221])).
% 21.05/11.93  cnf(d19, plain, nil = sK254, inference(resolution, [status(thm)], [d18,d8])).
% 21.05/11.93  cnf(d20, plain, nil = sK255, inference(resolution, [status(thm)], [d19,d1])).
% 21.05/11.93  cnf(d21, plain, app(sK254,X0) != sK255 | nil != sK255 | ~ssList(X0) | ~'Ts253'(sK254,X0), inference(resolution, [status(thm)], [d2,c220])).
% 21.05/11.93  cnf(d22, plain, sK255 != sK255 | nil != sK255 | ~ssList(sK258) | ~'Ts253'(sK254,sK258), inference(superposition, [status(thm)], [d5,d21])).
% 21.05/11.93  cnf(d23, plain, nil != sK255 | sK255 != sK255 | ~'Ts253'(sK254,sK258), inference(resolution, [status(thm)], [c214,d22])).
% 21.05/11.93  cnf(d24, plain, nil != sK255 | ~'Ts253'(sK254,sK258), inference(equality_resolution, [status(thm)], [d23])).
% 21.05/11.93  cnf(d25, plain, nil != sK255, inference(resolution, [status(thm)], [d18,d24])).
% 21.05/11.93  cnf(d26, plain, $false, inference(resolution, [status(thm)], [d25,d20])).
% 21.05/11.93  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------