↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n018.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:41:00 AM UTC 2026

% Result   : Theorem 10.54s 2.02s
% Output   : CNFRefutation 10.54s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU142+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n018.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 08:42:07 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.54/2.02  % SZS status Theorem for theBenchmark.p
% 10.54/2.02  % SZS output start CNFRefutation for theBenchmark.p
% 10.54/2.02  fof(d1_tarski, axiom, ! [X0] : ! [X1] : ((X1 = singleton(X0) <=> ! [X2] : ((in(X2,X1) <=> X2 = X0))))).
% 10.54/2.02  fof(d2_tarski, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'unordered$upair'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (X3 = X0 | X3 = X1)))))).
% 10.54/2.02  fof(t69_enumset1, conjecture, ! [X0] : 'unordered$upair'(X0,X0) = singleton(X0)).
% 10.54/2.02  fof(negated_conjecture, negated_conjecture, ~! [X0] : 'unordered$upair'(X0,X0) = singleton(X0), inference(negate_conjecture, [status(cth)], [t69_enumset1])).
% 10.54/2.02  cnf(c5, plain, X0 = singleton(X1) | in(sK7(X1,X0),X0) | sK7(X1,X0) = X1, inference(clausification, [status(esa)], [d1_tarski])).
% 10.54/2.02  cnf(c6, plain, X0 = singleton(X1) | sK7(X1,X0) != X1 | ~in(sK7(X1,X0),X0), inference(clausification, [status(esa)], [d1_tarski])).
% 10.54/2.02  cnf(c8, plain, X0 != 'unordered$upair'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d2_tarski])).
% 10.54/2.02  cnf(c10, plain, ~X0(X1,X2,X3) | ~in(X4,X3) | X4 = X1 | X4 = X2, inference(clausification, [status(esa)], [d2_tarski])).
% 10.54/2.02  cnf(c11, plain, ~X0(X1,X2,X3) | in(X4,X3) | X4 != X1, inference(clausification, [status(esa)], [d2_tarski])).
% 10.54/2.02  cnf(c23, plain, 'unordered$upair'(sK17,sK17) != singleton(sK17), inference(clausification, [status(esa)], [negated_conjecture])).
% 10.54/2.02  cnf(d0, plain, 'Ts8'(X0,X1,'unordered$upair'(X0,X1)), inference(equality_resolution, [status(thm)], [c8])).
% 10.54/2.02  cnf(d1, plain, X0 = X1 | X0 = X2 | ~in(X0,'unordered$upair'(X2,X1)), inference(resolution, [status(thm)], [c10,d0])).
% 10.54/2.02  cnf(d2, plain, sK7(X0,'unordered$upair'(X1,X2)) = X1 | sK7(X0,'unordered$upair'(X1,X2)) = X2 | 'unordered$upair'(X1,X2) = singleton(X0) | sK7(X0,'unordered$upair'(X1,X2)) = X0, inference(resolution, [status(thm)], [d1,c5])).
% 10.54/2.02  cnf(d3, plain, X2 != X1 | 'unordered$upair'(X1,X2) = singleton(X0) | sK7(X0,'unordered$upair'(X1,X2)) = X1 | sK7(X0,'unordered$upair'(X1,X2)) = X0, inference(equality_factoring, [status(thm)], [d2])).
% 10.54/2.02  cnf(d4, plain, 'unordered$upair'(X0,X0) = singleton(X1) | sK7(X1,'unordered$upair'(X0,X0)) = X0 | sK7(X1,'unordered$upair'(X0,X0)) = X1, inference(equality_resolution, [status(thm)], [d3])).
% 10.54/2.02  cnf(d5, plain, X0 != X1 | 'unordered$upair'(X1,X1) = singleton(X0) | sK7(X0,'unordered$upair'(X1,X1)) = X1, inference(equality_factoring, [status(thm)], [d4])).
% 10.54/2.02  cnf(d6, plain, 'unordered$upair'(X0,X0) = singleton(X0) | sK7(X0,'unordered$upair'(X0,X0)) = X0, inference(equality_resolution, [status(thm)], [d5])).
% 10.54/2.02  cnf(d7, plain, X0 != X0 | 'unordered$upair'(X0,X0) = singleton(X0) | ~in(sK7(X0,'unordered$upair'(X0,X0)),'unordered$upair'(X0,X0)) | 'unordered$upair'(X0,X0) = singleton(X0), inference(superposition, [status(thm)], [d6,c6])).
% 10.54/2.02  cnf(d8, plain, 'unordered$upair'(X0,X0) = singleton(X0) | ~in(sK7(X0,'unordered$upair'(X0,X0)),'unordered$upair'(X0,X0)), inference(equality_resolution, [status(thm)], [d7])).
% 10.54/2.02  cnf(d9, plain, ~in(X0,'unordered$upair'(X0,X0)) | 'unordered$upair'(X0,X0) = singleton(X0) | 'unordered$upair'(X0,X0) = singleton(X0), inference(superposition, [status(thm)], [d6,d8])).
% 10.54/2.02  cnf(d10, plain, in(X0,X1) | ~'Ts8'(X0,X2,X1), inference(equality_resolution, [status(thm)], [c11])).
% 10.54/2.02  cnf(d11, plain, in(X0,'unordered$upair'(X0,X1)), inference(resolution, [status(thm)], [d10,d0])).
% 10.54/2.02  cnf(d12, plain, 'unordered$upair'(X0,X0) = singleton(X0), inference(resolution, [status(thm)], [d11,d9])).
% 10.54/2.02  cnf(d13, plain, $false, inference(resolution, [status(thm)], [d12,c23])).
% 10.54/2.02  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------