↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n006.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:54:47 AM UTC 2026

% Result   : Theorem 19.17s 12.88s
% Output   : CNFRefutation 19.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC259+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/10.38  % Computer : n006.cluster.edu
% 0.10/10.38  % Model    : x86_64 x86_64
% 0.10/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38  % Memory   : 8046.5625MB
% 0.10/10.38  % OS       : Linux 6.8.0-71-generic
% 0.10/10.38  % CPULimit : 300
% 0.10/10.38  % WCLimit  : 300
% 0.10/10.38  % DateTime : Sat Sep 26 12:37:50 UTC 2026
% 0.10/10.38  % CPUTime  : 
% 0.10/10.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 19.17/12.88  % SZS status Theorem for theBenchmark.p
% 19.17/12.88  % SZS output start CNFRefutation for theBenchmark.p
% 19.17/12.88  fof(ax4, axiom, ! [X0] : ((ssList(X0) => (singletonP(X0) <=> ? [X1] : ((ssItem(X1) & cons(X1,nil) = X0)))))).
% 19.17/12.88  fof(ax7, axiom, ! [X0] : ((ssList(X0) => ! [X1] : ((ssList(X1) => (segmentP(X0,X1) <=> ? [X2] : ((ssList(X2) & ? [X3] : ((ssList(X3) & app(app(X2,X1),X3) = X0)))))))))).
% 19.17/12.88  fof(ax58, axiom, ! [X0] : ((ssList(X0) => (segmentP(nil,X0) <=> nil = X0)))).
% 19.17/12.88  fof(ax65, axiom, ! [X0] : ((ssItem(X0) => totalorderedP(cons(X0,nil))))).
% 19.17/12.88  fof(ax66, axiom, totalorderedP(nil)).
% 19.17/12.88  fof(co1, conjecture, ! [X0] : ((ssList(X0) => ! [X1] : ((ssList(X1) => ! [X2] : ((ssList(X2) => ! [X3] : ((~ssList(X3) | (X1 != X3 | (X0 != X2 | (totalorderedP(X0) | (! [X4] : ((ssItem(X4) => ! [X5] : ((ssList(X5) => ! [X6] : ((~ssList(X6) | (cons(X4,nil) != X2 | (app(app(X5,X2),X6) != X3 | (? [X7] : ((ssItem(X7) & (memberP(X5,X7) & lt(X4,X7)))) | ? [X8] : ((ssItem(X8) & (memberP(X6,X8) & lt(X8,X4))))))))))))) & (nil != X3 | nil != X2)))))))))))))).
% 19.17/12.88  fof(negated_conjecture, negated_conjecture, ~! [X0] : ((ssList(X0) => ! [X1] : ((ssList(X1) => ! [X2] : ((ssList(X2) => ! [X3] : ((~ssList(X3) | (X1 != X3 | (X0 != X2 | (totalorderedP(X0) | (! [X4] : ((ssItem(X4) => ! [X5] : ((ssList(X5) => ! [X6] : ((~ssList(X6) | (cons(X4,nil) != X2 | (app(app(X5,X2),X6) != X3 | (? [X7] : ((ssItem(X7) & (memberP(X5,X7) & lt(X4,X7)))) | ? [X8] : ((ssItem(X8) & (memberP(X6,X8) & lt(X8,X4))))))))))))) & (nil != X3 | nil != X2))))))))))))), inference(negate_conjecture, [status(cth)], [co1])).
% 19.17/12.88  cnf(c9, plain, ~ssList(X0) | ~singletonP(X0) | ssItem(sK11(X0)), inference(clausification, [status(esa)], [ax4])).
% 19.17/12.88  cnf(c10, plain, ~ssList(X0) | ~singletonP(X0) | cons(sK11(X0),nil) = X0, inference(clausification, [status(esa)], [ax4])).
% 19.17/12.88  cnf(c11, plain, ~ssList(X0) | singletonP(X0) | ~ssItem(X1) | cons(X1,nil) != X0, inference(clausification, [status(esa)], [ax4])).
% 19.17/12.88  cnf(c21, plain, segmentP(X0,X1) | ~ssList(X1) | app(app(X2,X1),X3) != X0 | ~ssList(X3) | ~ssList(X0) | ~ssList(X2), inference(clausification, [status(esa)], [ax7])).
% 19.17/12.88  cnf(c151, plain, ~ssList(X0) | ~segmentP(nil,X0) | nil = X0, inference(clausification, [status(esa)], [ax58])).
% 19.17/12.88  cnf(c159, plain, ~ssItem(X0) | totalorderedP(cons(X0,nil)), inference(clausification, [status(esa)], [ax65])).
% 19.17/12.88  cnf(c160, plain, totalorderedP(nil), inference(clausification, [status(esa)], [ax66])).
% 19.17/12.88  cnf(c210, plain, ssList(sK256), inference(clausification, [status(esa)], [negated_conjecture])).
% 19.17/12.88  cnf(c211, plain, ssList(sK257), inference(clausification, [status(esa)], [negated_conjecture])).
% 19.17/12.88  cnf(c213, plain, sK254 = sK256, inference(clausification, [status(esa)], [negated_conjecture])).
% 19.17/12.88  cnf(c214, plain, ~totalorderedP(sK254), inference(clausification, [status(esa)], [negated_conjecture])).
% 19.17/12.88  cnf(c215, plain, ~X0(sK256,sK257) | nil = sK257, inference(clausification, [status(esa)], [negated_conjecture])).
% 19.17/12.88  cnf(c216, plain, ~X0(sK256,sK257) | nil = sK256, inference(clausification, [status(esa)], [negated_conjecture])).
% 19.17/12.88  cnf(c217, plain, X0(X1,X2) | ssItem(sK258(X1,X2)), inference(clausification, [status(esa)], [negated_conjecture])).
% 19.17/12.88  cnf(c218, plain, X0(X1,X2) | ssList(sK259(X1,X2)), inference(clausification, [status(esa)], [negated_conjecture])).
% 19.17/12.88  cnf(c219, plain, X0(X1,X2) | ssList(sK260(X1,X2)), inference(clausification, [status(esa)], [negated_conjecture])).
% 19.17/12.88  cnf(c220, plain, X0(X1,X2) | cons(sK258(X1,X2),nil) = X1, inference(clausification, [status(esa)], [negated_conjecture])).
% 19.17/12.88  cnf(c221, plain, X0(X1,X2) | app(app(sK259(X1,X2),X1),sK260(X1,X2)) = X2, inference(clausification, [status(esa)], [negated_conjecture])).
% 19.17/12.88  cnf(d0, plain, cons(sK258(sK256,sK257),nil) = sK256 | nil = sK257, inference(resolution, [status(thm)], [c220,c215])).
% 19.17/12.88  cnf(d1, plain, sK256 != X0 | ~ssItem(sK258(sK256,sK257)) | ~ssList(X0) | singletonP(X0) | nil = sK257, inference(superposition, [status(thm)], [d0,c11])).
% 19.17/12.88  cnf(d2, plain, nil = sK257 | ~ssItem(sK258(sK256,sK257)) | ~ssList(sK256) | singletonP(sK256), inference(equality_resolution, [status(thm)], [d1])).
% 19.17/12.88  cnf(d3, plain, nil = sK257 | ~ssItem(sK258(sK256,sK257)) | singletonP(sK256), inference(resolution, [status(thm)], [c210,d2])).
% 19.17/12.88  cnf(d4, plain, nil = sK257 | singletonP(sK256) | 'Ts253'(sK256,sK257), inference(resolution, [status(thm)], [d3,c217])).
% 19.17/12.88  cnf(d5, plain, nil = sK257 | singletonP(sK256) | nil = sK257, inference(resolution, [status(thm)], [d4,c215])).
% 19.17/12.88  cnf(d6, plain, nil = sK257 | cons(sK11(sK256),nil) = sK256 | ~ssList(sK256), inference(resolution, [status(thm)], [d5,c10])).
% 19.17/12.88  cnf(d7, plain, cons(sK11(sK256),nil) = sK256 | nil = sK257, inference(resolution, [status(thm)], [c210,d6])).
% 19.17/12.88  cnf(d8, plain, totalorderedP(sK256) | ~ssItem(sK11(sK256)) | nil = sK257, inference(superposition, [status(thm)], [d7,c159])).
% 19.17/12.88  cnf(d9, plain, ~totalorderedP(sK256), inference(demodulation, [status(thm)], [c214,c213])).
% 19.17/12.88  cnf(d10, plain, nil = sK257 | ~ssItem(sK11(sK256)), inference(resolution, [status(thm)], [d9,d8])).
% 19.17/12.88  cnf(d11, plain, nil = sK257 | ~ssList(sK256) | ~singletonP(sK256), inference(resolution, [status(thm)], [d10,c9])).
% 19.17/12.88  cnf(d12, plain, nil = sK257 | ~singletonP(sK256), inference(resolution, [status(thm)], [c210,d11])).
% 19.17/12.88  cnf(d13, plain, nil = sK257 | nil = sK257, inference(resolution, [status(thm)], [d12,d5])).
% 19.17/12.88  cnf(d14, plain, app(app(sK259(sK256,sK257),sK256),sK260(sK256,sK257)) = sK257 | nil = sK256, inference(resolution, [status(thm)], [c221,c216])).
% 19.17/12.88  cnf(d15, plain, sK257 != X0 | ~ssList(X0) | ~ssList(sK260(sK256,sK257)) | ~ssList(sK256) | ~ssList(sK259(sK256,sK257)) | segmentP(X0,sK256) | nil = sK256, inference(superposition, [status(thm)], [d14,c21])).
% 19.17/12.88  cnf(d16, plain, nil = sK256 | sK257 != X0 | ~ssList(X0) | ~ssList(sK259(sK256,sK257)) | ~ssList(sK260(sK256,sK257)) | segmentP(X0,sK256), inference(resolution, [status(thm)], [c210,d15])).
% 19.17/12.88  cnf(d17, plain, nil = sK256 | ~ssList(sK257) | ~ssList(sK259(sK256,sK257)) | ~ssList(sK260(sK256,sK257)) | segmentP(sK257,sK256), inference(equality_resolution, [status(thm)], [d16])).
% 19.17/12.88  cnf(d18, plain, nil = sK256 | ~ssList(sK259(sK256,sK257)) | ~ssList(sK260(sK256,sK257)) | segmentP(sK257,sK256), inference(resolution, [status(thm)], [c211,d17])).
% 19.17/12.88  cnf(d19, plain, nil = sK256 | ~ssList(sK259(sK256,sK257)) | segmentP(sK257,sK256) | 'Ts253'(sK256,sK257), inference(resolution, [status(thm)], [d18,c219])).
% 19.17/12.88  cnf(d20, plain, nil = sK256 | segmentP(sK257,sK256) | 'Ts253'(sK256,sK257) | 'Ts253'(sK256,sK257), inference(resolution, [status(thm)], [d19,c218])).
% 19.17/12.88  cnf(d21, plain, nil = sK256 | segmentP(sK257,sK256) | nil = sK256, inference(resolution, [status(thm)], [d20,c216])).
% 19.17/12.88  cnf(d22, plain, nil = sK256 | segmentP(nil,sK256), inference(demodulation, [status(thm)], [d21,d13])).
% 19.17/12.88  cnf(d23, plain, nil = sK256 | nil = sK256 | ~ssList(sK256), inference(resolution, [status(thm)], [d22,c151])).
% 19.17/12.88  cnf(d24, plain, nil = sK256, inference(resolution, [status(thm)], [c210,d23])).
% 19.17/12.88  cnf(d25, plain, ~totalorderedP(nil), inference(demodulation, [status(thm)], [d9,d24])).
% 19.17/12.88  cnf(d26, plain, $false, inference(resolution, [status(thm)], [c160,d25])).
% 19.17/12.88  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------