↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n003.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:03 AM UTC 2026

% Result   : Theorem 11.94s 1.94s
% Output   : CNFRefutation 11.94s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU153+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n003.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 26 08:42:54 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.94/1.94  % SZS status Theorem for theBenchmark.p
% 11.94/1.94  % SZS output start CNFRefutation for theBenchmark.p
% 11.94/1.94  fof(d1_tarski, axiom, ! [X0] : ! [X1] : ((X1 = singleton(X0) <=> ! [X2] : ((in(X2,X1) <=> X2 = X0))))).
% 11.94/1.94  fof(d1_xboole_0, axiom, ! [X0] : ((X0 = 'empty$uset' <=> ! [X1] : ~in(X1,X0)))).
% 11.94/1.94  fof(d3_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$uintersection2'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & in(X3,X1))))))).
% 11.94/1.94  fof(d7_xboole_0, axiom, ! [X0] : ! [X1] : ((disjoint(X0,X1) <=> 'set$uintersection2'(X0,X1) = 'empty$uset'))).
% 11.94/1.94  fof(symmetry_r1_xboole_0, axiom, ! [X0] : ! [X1] : ((disjoint(X0,X1) => disjoint(X1,X0)))).
% 11.94/1.94  fof(l25_zfmisc_1, conjecture, ! [X0] : ! [X1] : ~((disjoint(singleton(X0),X1) & in(X0,X1)))).
% 11.94/1.94  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ~((disjoint(singleton(X0),X1) & in(X0,X1))), inference(negate_conjecture, [status(cth)], [l25_zfmisc_1])).
% 11.94/1.94  cnf(c2, plain, X0 != singleton(X1) | ~in(X2,X0) | X2 = X1, inference(clausification, [status(esa)], [d1_tarski])).
% 11.94/1.94  cnf(c3, plain, X0 != singleton(X1) | in(X2,X0) | X2 != X1, inference(clausification, [status(esa)], [d1_tarski])).
% 11.94/1.94  cnf(c8, plain, X0 != 'empty$uset' | ~in(X1,X0), inference(clausification, [status(esa)], [d1_xboole_0])).
% 11.94/1.94  cnf(c9, plain, X0 = 'empty$uset' | in(sK10(X0),X0), inference(clausification, [status(esa)], [d1_xboole_0])).
% 11.94/1.94  cnf(c10, plain, X0 != 'set$uintersection2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 11.94/1.94  cnf(c14, plain, ~X0(X1,X2,X3) | in(X4,X3) | ~in(X4,X1) | ~in(X4,X2), inference(clausification, [status(esa)], [d3_xboole_0])).
% 11.94/1.94  cnf(c21, plain, ~disjoint(X0,X1) | 'set$uintersection2'(X0,X1) = 'empty$uset', inference(clausification, [status(esa)], [d7_xboole_0])).
% 11.94/1.94  cnf(c27, plain, ~disjoint(X0,X1) | disjoint(X1,X0), inference(clausification, [status(esa)], [symmetry_r1_xboole_0])).
% 11.94/1.94  cnf(c28, plain, disjoint(singleton(sK25),sK26), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.94/1.94  cnf(c29, plain, in(sK25,sK26), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.94/1.94  cnf(d0, plain, X0 != X1 | in(X0,singleton(X1)), inference(equality_resolution, [status(thm)], [c3])).
% 11.94/1.94  cnf(d1, plain, in(X0,singleton(X0)), inference(equality_resolution, [status(thm)], [d0])).
% 11.94/1.94  cnf(d2, plain, 'Ts11'(X0,X1,'set$uintersection2'(X0,X1)), inference(equality_resolution, [status(thm)], [c10])).
% 11.94/1.94  cnf(d3, plain, disjoint(sK26,singleton(sK25)), inference(resolution, [status(thm)], [c27,c28])).
% 11.94/1.94  cnf(d4, plain, 'set$uintersection2'(sK26,singleton(sK25)) = 'empty$uset', inference(resolution, [status(thm)], [c21,d3])).
% 11.94/1.94  cnf(d5, plain, 'Ts11'(sK26,singleton(sK25),'empty$uset'), inference(superposition, [status(thm)], [d4,d2])).
% 11.94/1.94  cnf(d6, plain, in(X0,'empty$uset') | ~in(X0,singleton(sK25)) | ~in(X0,sK26), inference(resolution, [status(thm)], [d5,c14])).
% 11.94/1.94  cnf(d7, plain, ~in(X0,'empty$uset'), inference(equality_resolution, [status(thm)], [c8])).
% 11.94/1.94  cnf(d8, plain, ~in(X0,singleton(sK25)) | ~in(X0,sK26), inference(resolution, [status(thm)], [d7,d6])).
% 11.94/1.94  cnf(d9, plain, ~in(sK10(singleton(sK25)),sK26) | singleton(sK25) = 'empty$uset', inference(resolution, [status(thm)], [d8,c9])).
% 11.94/1.94  cnf(d10, plain, X0 = X1 | ~in(X0,singleton(X1)), inference(equality_resolution, [status(thm)], [c2])).
% 11.94/1.94  cnf(d11, plain, sK10(singleton(X0)) = X0 | singleton(X0) = 'empty$uset', inference(resolution, [status(thm)], [d10,c9])).
% 11.94/1.94  cnf(d12, plain, ~in(sK25,sK26) | singleton(sK25) = 'empty$uset' | singleton(sK25) = 'empty$uset', inference(superposition, [status(thm)], [d11,d9])).
% 11.94/1.94  cnf(d13, plain, singleton(sK25) = 'empty$uset', inference(resolution, [status(thm)], [c29,d12])).
% 11.94/1.94  cnf(d14, plain, in(sK25,'empty$uset'), inference(superposition, [status(thm)], [d13,d1])).
% 11.94/1.94  cnf(d15, plain, $false, inference(resolution, [status(thm)], [d7,d14])).
% 11.94/1.94  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------