↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET908+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/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:33:32 AM UTC 2026

% Result   : Theorem 18.50s 2.84s
% Output   : CNFRefutation 18.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET908+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  % Computer : n018.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Sat Sep 26 08:27:23 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.50/2.84  % SZS status Theorem for theBenchmark.p
% 18.50/2.84  % SZS output start CNFRefutation for theBenchmark.p
% 18.50/2.84  fof(commutativity_k2_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uunion2'(X0,X1) = 'set$uunion2'(X1,X0)).
% 18.50/2.84  fof(d1_tarski, axiom, ! [X0] : ! [X1] : ((X1 = singleton(X0) <=> ! [X2] : ((in(X2,X1) <=> X2 = X0))))).
% 18.50/2.84  fof(d1_xboole_0, axiom, ! [X0] : ((X0 = 'empty$uset' <=> ! [X1] : ~in(X1,X0)))).
% 18.50/2.84  fof(d2_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$uunion2'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) | in(X3,X1))))))).
% 18.50/2.84  fof(t49_zfmisc_1, conjecture, ! [X0] : ! [X1] : 'set$uunion2'(singleton(X0),X1) != 'empty$uset').
% 18.50/2.84  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : 'set$uunion2'(singleton(X0),X1) != 'empty$uset', inference(negate_conjecture, [status(cth)], [t49_zfmisc_1])).
% 18.50/2.84  cnf(c1, plain, 'set$uunion2'(X0,X1) = 'set$uunion2'(X1,X0), inference(clausification, [status(esa)], [commutativity_k2_xboole_0])).
% 18.50/2.84  cnf(c3, plain, X0 != singleton(X1) | in(X2,X0) | X2 != X1, inference(clausification, [status(esa)], [d1_tarski])).
% 18.50/2.84  cnf(c8, plain, X0 != 'empty$uset' | ~in(X1,X0), inference(clausification, [status(esa)], [d1_xboole_0])).
% 18.50/2.84  cnf(c9, plain, X0 = 'empty$uset' | in(sK10(X0),X0), inference(clausification, [status(esa)], [d1_xboole_0])).
% 18.50/2.84  cnf(c10, plain, X0 != 'set$uunion2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d2_xboole_0])).
% 18.50/2.84  cnf(c14, plain, ~X0(X1,X2,X3) | in(X4,X3) | ~in(X4,X2), inference(clausification, [status(esa)], [d2_xboole_0])).
% 18.50/2.84  cnf(c27, plain, 'set$uunion2'(singleton(sK25),sK26) = 'empty$uset', inference(clausification, [status(esa)], [negated_conjecture])).
% 18.50/2.84  cnf(d0, plain, 'set$uunion2'(sK26,singleton(sK25)) = 'empty$uset', inference(demodulation, [status(thm)], [c27,c1])).
% 18.50/2.84  cnf(d1, plain, X0 != 'empty$uset' | 'Ts11'(sK26,singleton(sK25),X0), inference(superposition, [status(thm)], [d0,c10])).
% 18.50/2.84  cnf(d2, plain, 'Ts11'(sK26,singleton(sK25),'empty$uset'), inference(equality_resolution, [status(thm)], [d1])).
% 18.50/2.84  cnf(d3, plain, in(X0,'empty$uset') | ~in(X0,singleton(sK25)), inference(resolution, [status(thm)], [c14,d2])).
% 18.50/2.84  cnf(d4, plain, ~in(X0,'empty$uset'), inference(equality_resolution, [status(thm)], [c8])).
% 18.50/2.84  cnf(d5, plain, ~in(X0,singleton(sK25)), inference(resolution, [status(thm)], [d4,d3])).
% 18.50/2.84  cnf(d6, plain, singleton(sK25) = 'empty$uset', inference(resolution, [status(thm)], [d5,c9])).
% 18.50/2.84  cnf(d7, plain, X0 != 'empty$uset' | X1 != sK25 | in(X1,X0), inference(superposition, [status(thm)], [d6,c3])).
% 18.50/2.84  cnf(d8, plain, X0 != sK25 | in(X0,'empty$uset'), inference(equality_resolution, [status(thm)], [d7])).
% 18.50/2.84  cnf(d9, plain, X0 != sK25, inference(resolution, [status(thm)], [d4,d8])).
% 18.50/2.84  cnf(d10, plain, $false, inference(equality_resolution, [status(thm)], [d9])).
% 18.50/2.84  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------