↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 59.01s 8.09s
% Output   : CNFRefutation 59.01s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC204+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43  % Computer : n019.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.43  % CPULimit : 300
% 0.18/0.43  % WCLimit  : 300
% 0.18/0.43  % DateTime : Sat Sep 26 12:30:49 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 59.01/8.09  % SZS status Theorem for theBenchmark.p
% 59.01/8.09  % SZS output start CNFRefutation for theBenchmark.p
% 59.01/8.09  fof(ax15, axiom, ! [X0] : ((ssList(X0) => ! [X1] : ((ssList(X1) => (neq(X0,X1) <=> X0 != X1)))))).
% 59.01/8.09  fof(ax17, axiom, ssList(nil)).
% 59.01/8.09  fof(ax18, axiom, ! [X0] : ((ssList(X0) => ! [X1] : ((ssItem(X1) => cons(X1,X0) != X0))))).
% 59.01/8.09  fof(ax20, axiom, ! [X0] : ((ssList(X0) => (nil = X0 | ? [X1] : ((ssList(X1) & ? [X2] : ((ssItem(X2) & cons(X2,X1) = X0)))))))).
% 59.01/8.09  fof(ax25, axiom, ! [X0] : ((ssList(X0) => ! [X1] : ((ssItem(X1) => tl(cons(X1,X0)) = X0))))).
% 59.01/8.09  fof(ax28, axiom, ! [X0] : ((ssList(X0) => app(nil,X0) = X0))).
% 59.01/8.09  fof(co1, conjecture, ! [X0] : ((ssList(X0) => ! [X1] : ((ssList(X1) => ! [X2] : ((ssList(X2) => ! [X3] : ((ssList(X3) => (X1 != X3 | (X0 != X2 | ((~neq(X1,nil) | (? [X4] : ((ssList(X4) & (X3 != X4 & ? [X5] : ((ssList(X5) & (tl(X3) = X5 & (app(X2,X5) = X4 & neq(nil,X3)))))))) | neq(X0,nil))) & (~neq(X1,nil) | neq(X3,nil)))))))))))))).
% 59.01/8.09  fof(negated_conjecture, negated_conjecture, ~! [X0] : ((ssList(X0) => ! [X1] : ((ssList(X1) => ! [X2] : ((ssList(X2) => ! [X3] : ((ssList(X3) => (X1 != X3 | (X0 != X2 | ((~neq(X1,nil) | (? [X4] : ((ssList(X4) & (X3 != X4 & ? [X5] : ((ssList(X5) & (tl(X3) = X5 & (app(X2,X5) = X4 & neq(nil,X3)))))))) | neq(X0,nil))) & (~neq(X1,nil) | neq(X3,nil))))))))))))), inference(negate_conjecture, [status(cth)], [co1])).
% 59.01/8.09  cnf(c95, plain, ~ssList(X0) | ~ssList(X1) | neq(X0,X1) | X0 = X1, inference(clausification, [status(esa)], [ax15])).
% 59.01/8.09  cnf(c97, plain, ssList(nil), inference(clausification, [status(esa)], [ax17])).
% 59.01/8.09  cnf(c98, plain, ~ssList(X0) | ~ssItem(X1) | cons(X1,X0) != X0, inference(clausification, [status(esa)], [ax18])).
% 59.01/8.09  cnf(c101, plain, ~ssList(X0) | nil = X0 | ssList(sK120(X0)), inference(clausification, [status(esa)], [ax20])).
% 59.01/8.09  cnf(c102, plain, ~ssList(X0) | nil = X0 | ssItem(sK121(X0)), inference(clausification, [status(esa)], [ax20])).
% 59.01/8.09  cnf(c103, plain, ~ssList(X0) | nil = X0 | cons(sK121(X0),sK120(X0)) = X0, inference(clausification, [status(esa)], [ax20])).
% 59.01/8.09  cnf(c108, plain, ~ssList(X0) | ~ssItem(X1) | tl(cons(X1,X0)) = X0, inference(clausification, [status(esa)], [ax25])).
% 59.01/8.09  cnf(c111, plain, ~ssList(X0) | app(nil,X0) = X0, inference(clausification, [status(esa)], [ax28])).
% 59.01/8.09  cnf(c208, plain, ssList(sK254), inference(clausification, [status(esa)], [negated_conjecture])).
% 59.01/8.09  cnf(c209, plain, ssList(sK255), inference(clausification, [status(esa)], [negated_conjecture])).
% 59.01/8.09  cnf(c212, plain, sK255 = sK257, inference(clausification, [status(esa)], [negated_conjecture])).
% 59.01/8.09  cnf(c213, plain, sK254 = sK256, inference(clausification, [status(esa)], [negated_conjecture])).
% 59.01/8.09  cnf(c214, plain, ~X0(sK254,sK255,sK256,sK257) | neq(sK255,nil), inference(clausification, [status(esa)], [negated_conjecture])).
% 59.01/8.09  cnf(c215, plain, ~X0(sK254,sK255,sK256,sK257) | ~neq(sK257,nil), inference(clausification, [status(esa)], [negated_conjecture])).
% 59.01/8.09  cnf(c216, plain, X0(X1,X2,X3,X4) | neq(X2,nil), inference(clausification, [status(esa)], [negated_conjecture])).
% 59.01/8.09  cnf(c217, plain, ~ssList(X0) | ~neq(nil,X1) | X1 = X0 | tl(X1) != X2 | X3(X4,X5,X6,X1) | ~ssList(X2) | app(X6,X2) != X0, inference(clausification, [status(esa)], [negated_conjecture])).
% 59.01/8.09  cnf(c218, plain, X0(X1,X2,X3,X4) | ~neq(X1,nil), inference(clausification, [status(esa)], [negated_conjecture])).
% 59.01/8.09  cnf(d0, plain, ~neq(sK255,nil) | ~'Ts253'(sK254,sK255,sK256,sK257), inference(demodulation, [status(thm)], [c215,c212])).
% 59.01/8.09  cnf(d1, plain, ~neq(sK255,nil) | ~'Ts253'(sK254,sK255,sK254,sK257), inference(demodulation, [status(thm)], [d0,c213])).
% 59.01/8.09  cnf(d2, plain, ~neq(sK255,nil) | ~'Ts253'(sK254,sK255,sK254,sK255), inference(demodulation, [status(thm)], [d1,c212])).
% 59.01/8.09  cnf(d3, plain, ~neq(sK255,nil) | ~neq(sK254,nil), inference(resolution, [status(thm)], [d2,c218])).
% 59.01/8.09  cnf(d4, plain, neq(sK255,nil) | ~'Ts253'(sK254,sK255,sK254,sK257), inference(demodulation, [status(thm)], [c214,c213])).
% 59.01/8.09  cnf(d5, plain, neq(sK255,nil) | ~'Ts253'(sK254,sK255,sK254,sK255), inference(demodulation, [status(thm)], [d4,c212])).
% 59.01/8.09  cnf(d6, plain, neq(sK255,nil) | neq(sK255,nil), inference(resolution, [status(thm)], [c216,d5])).
% 59.01/8.09  cnf(d7, plain, ~neq(sK254,nil), inference(resolution, [status(thm)], [d6,d3])).
% 59.01/8.09  cnf(d8, plain, sK254 = nil | ~ssList(nil) | ~ssList(sK254), inference(resolution, [status(thm)], [c95,d7])).
% 59.01/8.09  cnf(d9, plain, sK254 = nil | ~ssList(nil), inference(resolution, [status(thm)], [c208,d8])).
% 59.01/8.09  cnf(d10, plain, sK254 = nil, inference(resolution, [status(thm)], [c97,d9])).
% 59.01/8.09  cnf(d11, plain, ~'Ts253'(sK254,sK255,sK254,sK255), inference(resolution, [status(thm)], [d6,d2])).
% 59.01/8.09  cnf(d12, plain, ~'Ts253'(nil,sK255,sK254,sK255), inference(demodulation, [status(thm)], [d11,d10])).
% 59.01/8.09  cnf(d13, plain, ~'Ts253'(nil,sK255,nil,sK255), inference(demodulation, [status(thm)], [d12,d10])).
% 59.01/8.09  cnf(d14, plain, X0 != X1 | X2 = X1 | tl(X2) != X0 | ~neq(nil,X2) | ~ssList(X1) | ~ssList(X0) | 'Ts253'(X3,X4,nil,X2) | ~ssList(X0), inference(superposition, [status(thm)], [c111,c217])).
% 59.01/8.09  cnf(d15, plain, X1 != X2 | cons(X0,X1) = X3 | X2 != X3 | ~neq(nil,cons(X0,X1)) | ~ssList(X3) | ~ssList(X2) | 'Ts253'(X4,X5,nil,cons(X0,X1)) | ~ssItem(X0) | ~ssList(X1), inference(superposition, [status(thm)], [c108,d14])).
% 59.01/8.09  cnf(d16, plain, X0 != X1 | cons(X2,X0) = X1 | ~ssItem(X2) | ~neq(nil,cons(X2,X0)) | ~ssList(X1) | ~ssList(X0) | ~ssList(X0) | 'Ts253'(X3,X4,nil,cons(X2,X0)), inference(equality_resolution, [status(thm)], [d15])).
% 59.01/8.09  cnf(d17, plain, cons(X0,X1) = X1 | ~ssItem(X0) | ~neq(nil,cons(X0,X1)) | ~ssList(X1) | ~ssList(X1) | 'Ts253'(X2,X3,nil,cons(X0,X1)), inference(equality_resolution, [status(thm)], [d16])).
% 59.01/8.09  cnf(d18, plain, 'Ts253'(X1,X2,nil,X0) | cons(sK121(X0),sK120(X0)) = sK120(X0) | ~ssItem(sK121(X0)) | ~neq(nil,cons(sK121(X0),sK120(X0))) | ~ssList(sK120(X0)) | nil = X0 | ~ssList(X0), inference(superposition, [status(thm)], [c103,d17])).
% 59.01/8.09  cnf(d19, plain, sK120(X0) = X0 | nil = X0 | ~ssList(X0) | nil = X0 | ~ssItem(sK121(X0)) | ~neq(nil,cons(sK121(X0),sK120(X0))) | ~ssList(X0) | ~ssList(sK120(X0)) | 'Ts253'(X1,X2,nil,X0), inference(superposition, [status(thm)], [d18,c103])).
% 59.01/8.09  cnf(d20, plain, ~neq(nil,X0) | nil = X0 | sK120(X0) = X0 | ~ssItem(sK121(X0)) | ~ssList(X0) | ~ssList(sK120(X0)) | 'Ts253'(X1,X2,nil,X0) | nil = X0 | ~ssList(X0), inference(superposition, [status(thm)], [c103,d19])).
% 59.01/8.09  cnf(d21, plain, nil = sK255 | sK120(sK255) = sK255 | ~ssItem(sK121(sK255)) | ~neq(nil,sK255) | ~ssList(sK255) | ~ssList(sK120(sK255)), inference(resolution, [status(thm)], [d20,d13])).
% 59.01/8.09  cnf(d22, plain, nil = sK255 | sK120(sK255) = sK255 | ~ssItem(sK121(sK255)) | ~neq(nil,sK255) | ~ssList(sK120(sK255)), inference(resolution, [status(thm)], [c209,d21])).
% 59.01/8.09  cnf(d23, plain, cons(sK121(sK255),sK255) = sK255 | nil = sK255 | ~ssList(sK255) | nil = sK255 | ~ssItem(sK121(sK255)) | ~neq(nil,sK255) | ~ssList(sK120(sK255)), inference(superposition, [status(thm)], [d22,c103])).
% 59.01/8.09  cnf(d24, plain, cons(sK121(sK255),sK255) = sK255 | nil = sK255 | ~ssItem(sK121(sK255)) | ~neq(nil,sK255) | ~ssList(sK120(sK255)), inference(resolution, [status(thm)], [c209,d23])).
% 59.01/8.09  cnf(d25, plain, sK255 != sK255 | ~ssItem(sK121(sK255)) | ~ssList(sK255) | nil = sK255 | ~ssItem(sK121(sK255)) | ~neq(nil,sK255) | ~ssList(sK120(sK255)), inference(superposition, [status(thm)], [d24,c98])).
% 59.01/8.09  cnf(d26, plain, nil = sK255 | sK255 != sK255 | ~ssItem(sK121(sK255)) | ~neq(nil,sK255) | ~ssList(sK120(sK255)), inference(resolution, [status(thm)], [c209,d25])).
% 59.01/8.09  cnf(d27, plain, nil = sK255 | ~ssItem(sK121(sK255)) | ~neq(nil,sK255) | ~ssList(sK120(sK255)), inference(equality_resolution, [status(thm)], [d26])).
% 59.01/8.09  cnf(d28, plain, nil = sK255 | ~ssItem(sK121(sK255)) | ~neq(nil,sK255) | nil = sK255 | ~ssList(sK255), inference(resolution, [status(thm)], [d27,c101])).
% 59.01/8.09  cnf(d29, plain, nil = sK255 | ~ssItem(sK121(sK255)) | ~neq(nil,sK255), inference(resolution, [status(thm)], [c209,d28])).
% 59.01/8.09  cnf(d30, plain, nil = sK255 | ~ssItem(sK121(sK255)) | nil = sK255 | ~ssList(sK255) | ~ssList(nil), inference(resolution, [status(thm)], [d29,c95])).
% 59.01/8.09  cnf(d31, plain, nil = sK255 | ~ssItem(sK121(sK255)) | ~ssList(nil), inference(resolution, [status(thm)], [c209,d30])).
% 59.01/8.09  cnf(d32, plain, nil = sK255 | ~ssItem(sK121(sK255)), inference(resolution, [status(thm)], [c97,d31])).
% 59.01/8.09  cnf(d33, plain, nil = sK255 | nil = sK255 | ~ssList(sK255), inference(resolution, [status(thm)], [d32,c102])).
% 59.01/8.09  cnf(d34, plain, nil = sK255, inference(resolution, [status(thm)], [c209,d33])).
% 59.01/8.09  cnf(d35, plain, neq(nil,nil), inference(demodulation, [status(thm)], [d6,d34])).
% 59.01/8.09  cnf(d36, plain, ~neq(nil,nil), inference(demodulation, [status(thm)], [d7,d10])).
% 59.01/8.09  cnf(d37, plain, $false, inference(resolution, [status(thm)], [d36,d35])).
% 59.01/8.09  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------