↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWC336+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 : n010.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:01 AM UTC 2026

% Result   : Theorem 20.17s 13.13s
% Output   : CNFRefutation 20.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC336+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/10.59  % Computer : n010.cluster.edu
% 0.11/10.59  % Model    : x86_64 x86_64
% 0.11/10.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.59  % Memory   : 8046.5625MB
% 0.11/10.59  % OS       : Linux 6.8.0-71-generic
% 0.11/10.59  % CPULimit : 300
% 0.11/10.59  % WCLimit  : 300
% 0.11/10.59  % DateTime : Sat Sep 26 12:49:57 UTC 2026
% 0.11/10.59  % CPUTime  : 
% 0.11/10.59  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.17/13.13  % SZS status Theorem for theBenchmark.p
% 20.17/13.13  % SZS output start CNFRefutation for theBenchmark.p
% 20.17/13.13  fof(ax7, axiom, ! [X0] : ((ssList(X0) => ! [X1] : ((ssList(X1) => (segmentP(X0,X1) <=> ? [X2] : ((ssList(X2) & ? [X3] : ((ssList(X3) & app(app(X2,X1),X3) = X0)))))))))).
% 20.17/13.13  fof(ax17, axiom, ssList(nil)).
% 20.17/13.13  fof(ax57, axiom, ! [X0] : ((ssList(X0) => segmentP(X0,nil)))).
% 20.17/13.13  fof(ax58, axiom, ! [X0] : ((ssList(X0) => (segmentP(nil,X0) <=> nil = X0)))).
% 20.17/13.13  fof(ax65, axiom, ! [X0] : ((ssItem(X0) => totalorderedP(cons(X0,nil))))).
% 20.17/13.13  fof(ax66, axiom, totalorderedP(nil)).
% 20.17/13.13  fof(co1, conjecture, ! [X0] : ((ssList(X0) => ! [X1] : ((ssList(X1) => ! [X2] : ((ssList(X2) => ! [X3] : ((~ssList(X3) | (X1 != X3 | (X0 != X2 | ((! [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)) | (segmentP(X1,X0) & totalorderedP(X0)))))))))))))).
% 20.17/13.13  fof(negated_conjecture, negated_conjecture, ~! [X0] : ((ssList(X0) => ! [X1] : ((ssList(X1) => ! [X2] : ((ssList(X2) => ! [X3] : ((~ssList(X3) | (X1 != X3 | (X0 != X2 | ((! [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)) | (segmentP(X1,X0) & totalorderedP(X0))))))))))))), inference(negate_conjecture, [status(cth)], [co1])).
% 20.17/13.13  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])).
% 20.17/13.13  cnf(c97, plain, ssList(nil), inference(clausification, [status(esa)], [ax17])).
% 20.17/13.13  cnf(c150, plain, ~ssList(X0) | segmentP(X0,nil), inference(clausification, [status(esa)], [ax57])).
% 20.17/13.13  cnf(c151, plain, ~ssList(X0) | ~segmentP(nil,X0) | nil = X0, inference(clausification, [status(esa)], [ax58])).
% 20.17/13.13  cnf(c159, plain, ~ssItem(X0) | totalorderedP(cons(X0,nil)), inference(clausification, [status(esa)], [ax65])).
% 20.17/13.13  cnf(c160, plain, totalorderedP(nil), inference(clausification, [status(esa)], [ax66])).
% 20.17/13.13  cnf(c210, plain, ssList(sK256), inference(clausification, [status(esa)], [negated_conjecture])).
% 20.17/13.13  cnf(c211, plain, ssList(sK257), inference(clausification, [status(esa)], [negated_conjecture])).
% 20.17/13.13  cnf(c212, plain, sK255 = sK257, inference(clausification, [status(esa)], [negated_conjecture])).
% 20.17/13.13  cnf(c213, plain, sK254 = sK256, inference(clausification, [status(esa)], [negated_conjecture])).
% 20.17/13.13  cnf(c214, plain, ~X0(sK256,sK257) | nil = sK257, inference(clausification, [status(esa)], [negated_conjecture])).
% 20.17/13.13  cnf(c215, plain, ~X0(sK256,sK257) | nil = sK256, inference(clausification, [status(esa)], [negated_conjecture])).
% 20.17/13.13  cnf(c216, plain, ~segmentP(sK255,sK254) | ~totalorderedP(sK254), inference(clausification, [status(esa)], [negated_conjecture])).
% 20.17/13.13  cnf(c217, plain, X0(X1,X2) | ssItem(sK258(X1,X2)), inference(clausification, [status(esa)], [negated_conjecture])).
% 20.17/13.13  cnf(c218, plain, X0(X1,X2) | ssList(sK259(X1,X2)), inference(clausification, [status(esa)], [negated_conjecture])).
% 20.17/13.13  cnf(c219, plain, X0(X1,X2) | ssList(sK260(X1,X2)), inference(clausification, [status(esa)], [negated_conjecture])).
% 20.17/13.13  cnf(c220, plain, X0(X1,X2) | cons(sK258(X1,X2),nil) = X1, inference(clausification, [status(esa)], [negated_conjecture])).
% 20.17/13.13  cnf(c221, plain, X0(X1,X2) | app(app(sK259(X1,X2),X1),sK260(X1,X2)) = X2, inference(clausification, [status(esa)], [negated_conjecture])).
% 20.17/13.13  cnf(d0, plain, ~segmentP(sK257,sK254) | ~totalorderedP(sK254), inference(demodulation, [status(thm)], [c216,c212])).
% 20.17/13.13  cnf(d1, plain, ~segmentP(sK257,sK256) | ~totalorderedP(sK254), inference(demodulation, [status(thm)], [d0,c213])).
% 20.17/13.13  cnf(d2, plain, ~segmentP(sK257,sK256) | ~totalorderedP(sK256), inference(demodulation, [status(thm)], [d1,c213])).
% 20.17/13.13  cnf(d3, plain, app(app(sK259(sK256,sK257),sK256),sK260(sK256,sK257)) = sK257 | nil = sK257, inference(resolution, [status(thm)], [c221,c214])).
% 20.17/13.13  cnf(d4, plain, sK257 != X0 | ~ssList(X0) | ~ssList(sK260(sK256,sK257)) | ~ssList(sK256) | ~ssList(sK259(sK256,sK257)) | segmentP(X0,sK256) | nil = sK257, inference(superposition, [status(thm)], [d3,c21])).
% 20.17/13.13  cnf(d5, plain, nil = sK257 | sK257 != X0 | ~ssList(X0) | ~ssList(sK259(sK256,sK257)) | ~ssList(sK260(sK256,sK257)) | segmentP(X0,sK256), inference(resolution, [status(thm)], [c210,d4])).
% 20.17/13.13  cnf(d6, plain, nil = sK257 | ~ssList(sK257) | ~ssList(sK259(sK256,sK257)) | ~ssList(sK260(sK256,sK257)) | segmentP(sK257,sK256), inference(equality_resolution, [status(thm)], [d5])).
% 20.17/13.13  cnf(d7, plain, nil = sK257 | ~ssList(sK259(sK256,sK257)) | ~ssList(sK260(sK256,sK257)) | segmentP(sK257,sK256), inference(resolution, [status(thm)], [c211,d6])).
% 20.17/13.13  cnf(d8, plain, nil = sK257 | ~ssList(sK259(sK256,sK257)) | segmentP(sK257,sK256) | 'Ts253'(sK256,sK257), inference(resolution, [status(thm)], [d7,c219])).
% 20.17/13.13  cnf(d9, plain, nil = sK257 | segmentP(sK257,sK256) | 'Ts253'(sK256,sK257) | 'Ts253'(sK256,sK257), inference(resolution, [status(thm)], [d8,c218])).
% 20.17/13.13  cnf(d10, plain, nil = sK257 | segmentP(sK257,sK256) | nil = sK257, inference(resolution, [status(thm)], [d9,c214])).
% 20.17/13.13  cnf(d11, plain, nil = sK257 | ~totalorderedP(sK256), inference(resolution, [status(thm)], [d10,d2])).
% 20.17/13.13  cnf(d12, plain, cons(sK258(sK256,sK257),nil) = sK256 | nil = sK257, inference(resolution, [status(thm)], [c220,c214])).
% 20.17/13.13  cnf(d13, plain, totalorderedP(sK256) | ~ssItem(sK258(sK256,sK257)) | nil = sK257, inference(superposition, [status(thm)], [d12,c159])).
% 20.17/13.13  cnf(d14, plain, nil = sK257 | totalorderedP(sK256) | 'Ts253'(sK256,sK257), inference(resolution, [status(thm)], [d13,c217])).
% 20.17/13.13  cnf(d15, plain, nil = sK257 | totalorderedP(sK256) | nil = sK257, inference(resolution, [status(thm)], [d14,c214])).
% 20.17/13.13  cnf(d16, plain, nil = sK257 | nil = sK257, inference(resolution, [status(thm)], [d15,d11])).
% 20.17/13.13  cnf(d17, plain, app(app(sK259(sK256,sK257),sK256),sK260(sK256,sK257)) = sK257 | nil = sK256, inference(resolution, [status(thm)], [c221,c215])).
% 20.17/13.13  cnf(d18, plain, sK257 != X0 | ~ssList(X0) | ~ssList(sK260(sK256,sK257)) | ~ssList(sK256) | ~ssList(sK259(sK256,sK257)) | segmentP(X0,sK256) | nil = sK256, inference(superposition, [status(thm)], [d17,c21])).
% 20.17/13.13  cnf(d19, plain, nil = sK256 | sK257 != X0 | ~ssList(X0) | ~ssList(sK259(sK256,sK257)) | ~ssList(sK260(sK256,sK257)) | segmentP(X0,sK256), inference(resolution, [status(thm)], [c210,d18])).
% 20.17/13.13  cnf(d20, plain, nil = sK256 | ~ssList(sK257) | ~ssList(sK259(sK256,sK257)) | ~ssList(sK260(sK256,sK257)) | segmentP(sK257,sK256), inference(equality_resolution, [status(thm)], [d19])).
% 20.17/13.13  cnf(d21, plain, nil = sK256 | ~ssList(sK259(sK256,sK257)) | ~ssList(sK260(sK256,sK257)) | segmentP(sK257,sK256), inference(resolution, [status(thm)], [c211,d20])).
% 20.17/13.13  cnf(d22, plain, nil = sK256 | ~ssList(sK259(sK256,sK257)) | segmentP(sK257,sK256) | 'Ts253'(sK256,sK257), inference(resolution, [status(thm)], [d21,c219])).
% 20.17/13.13  cnf(d23, plain, nil = sK256 | segmentP(sK257,sK256) | 'Ts253'(sK256,sK257) | 'Ts253'(sK256,sK257), inference(resolution, [status(thm)], [d22,c218])).
% 20.17/13.13  cnf(d24, plain, nil = sK256 | segmentP(sK257,sK256) | nil = sK256, inference(resolution, [status(thm)], [d23,c215])).
% 20.17/13.13  cnf(d25, plain, nil = sK256 | segmentP(nil,sK256), inference(demodulation, [status(thm)], [d24,d16])).
% 20.17/13.13  cnf(d26, plain, nil = sK256 | nil = sK256 | ~ssList(sK256), inference(resolution, [status(thm)], [d25,c151])).
% 20.17/13.13  cnf(d27, plain, nil = sK256, inference(resolution, [status(thm)], [c210,d26])).
% 20.17/13.13  cnf(d28, plain, ~segmentP(nil,sK256) | ~totalorderedP(sK256), inference(demodulation, [status(thm)], [d2,d16])).
% 20.17/13.13  cnf(d29, plain, ~segmentP(nil,nil) | ~totalorderedP(sK256), inference(demodulation, [status(thm)], [d28,d27])).
% 20.17/13.13  cnf(d30, plain, ~segmentP(nil,nil) | ~totalorderedP(nil), inference(demodulation, [status(thm)], [d29,d27])).
% 20.17/13.13  cnf(d31, plain, ~segmentP(nil,nil), inference(resolution, [status(thm)], [c160,d30])).
% 20.17/13.13  cnf(d32, plain, ~ssList(nil), inference(resolution, [status(thm)], [d31,c150])).
% 20.17/13.13  cnf(d33, plain, $false, inference(resolution, [status(thm)], [c97,d32])).
% 20.17/13.13  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------