↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 20.08s 3.05s
% Output   : CNFRefutation 20.08s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SEU131+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43  % Computer : n018.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Sat Sep 26 08:40:21 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.08/3.05  % SZS status Theorem for theBenchmark.p
% 20.08/3.05  % SZS output start CNFRefutation for theBenchmark.p
% 20.08/3.05  fof(d3_tarski, axiom, ! [X0] : ! [X1] : ((subset(X0,X1) <=> ! [X2] : ((in(X2,X0) => in(X2,X1)))))).
% 20.08/3.05  fof(d4_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$udifference'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & ~in(X3,X1))))))).
% 20.08/3.05  fof(fc1_xboole_0, axiom, empty('empty$uset')).
% 20.08/3.05  fof(t7_boole, axiom, ! [X0] : ! [X1] : ~((in(X0,X1) & empty(X1)))).
% 20.08/3.05  fof(l32_xboole_1, conjecture, ! [X0] : ! [X1] : (('set$udifference'(X0,X1) = 'empty$uset' <=> subset(X0,X1)))).
% 20.08/3.05  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : (('set$udifference'(X0,X1) = 'empty$uset' <=> subset(X0,X1))), inference(negate_conjecture, [status(cth)], [l32_xboole_1])).
% 20.08/3.05  cnf(c1, plain, ~subset(X0,X1) | ~in(X2,X0) | in(X2,X1), inference(clausification, [status(esa)], [d3_tarski])).
% 20.08/3.05  cnf(c2, plain, subset(X0,X1) | in(sK5(X0,X1),X0), inference(clausification, [status(esa)], [d3_tarski])).
% 20.08/3.05  cnf(c3, plain, subset(X0,X1) | ~in(sK5(X0,X1),X1), inference(clausification, [status(esa)], [d3_tarski])).
% 20.08/3.05  cnf(c4, plain, X0 != 'set$udifference'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d4_xboole_0])).
% 20.08/3.05  cnf(c5, plain, X0 = 'set$udifference'(X1,X2) | ~X3(X1,X2,X0), inference(clausification, [status(esa)], [d4_xboole_0])).
% 20.08/3.05  cnf(c8, plain, ~X0(X1,X2,X3) | in(X4,X3) | ~in(X4,X1) | in(X4,X2), inference(clausification, [status(esa)], [d4_xboole_0])).
% 20.08/3.05  cnf(c10, plain, X0(X1,X2,X3) | in(sK11(X1,X2,X3),X3) | in(sK11(X1,X2,X3),X1), inference(clausification, [status(esa)], [d4_xboole_0])).
% 20.08/3.05  cnf(c11, plain, X0(X1,X2,X3) | in(sK11(X1,X2,X3),X3) | ~in(sK11(X1,X2,X3),X2), inference(clausification, [status(esa)], [d4_xboole_0])).
% 20.08/3.05  cnf(c15, plain, empty('empty$uset'), inference(clausification, [status(esa)], [fc1_xboole_0])).
% 20.08/3.05  cnf(c26, plain, ~in(X0,X1) | ~empty(X1), inference(clausification, [status(esa)], [t7_boole])).
% 20.08/3.05  cnf(c29, plain, 'set$udifference'(sK26,sK27) = 'empty$uset' | subset(sK26,sK27), inference(clausification, [status(esa)], [negated_conjecture])).
% 20.08/3.05  cnf(c30, plain, ~subset(sK26,sK27) | 'set$udifference'(sK26,sK27) != 'empty$uset', inference(clausification, [status(esa)], [negated_conjecture])).
% 20.08/3.05  cnf(d0, plain, 'Ts6'(X0,X1,'set$udifference'(X0,X1)), inference(equality_resolution, [status(thm)], [c4])).
% 20.08/3.05  cnf(d1, plain, in(X0,'set$udifference'(X1,X2)) | in(X0,X2) | ~in(X0,X1), inference(resolution, [status(thm)], [d0,c8])).
% 20.08/3.05  cnf(d2, plain, in(X0,sK27) | ~in(X0,sK26) | 'set$udifference'(sK26,sK27) = 'empty$uset', inference(resolution, [status(thm)], [c1,c29])).
% 20.08/3.05  cnf(d3, plain, in(sK11(sK26,X0,X1),X1) | 'Ts6'(sK26,X0,X1) | 'set$udifference'(sK26,sK27) = 'empty$uset' | in(sK11(sK26,X0,X1),sK27), inference(resolution, [status(thm)], [c10,d2])).
% 20.08/3.05  cnf(d4, plain, 'set$udifference'(sK26,sK27) = 'empty$uset' | in(sK11(sK26,sK27,X0),X0) | 'Ts6'(sK26,sK27,X0) | in(sK11(sK26,sK27,X0),X0) | 'Ts6'(sK26,sK27,X0), inference(resolution, [status(thm)], [d3,c11])).
% 20.08/3.05  cnf(d5, plain, 'set$udifference'(sK26,sK27) = 'empty$uset' | 'Ts6'(sK26,sK27,X0) | ~empty(X0), inference(resolution, [status(thm)], [d4,c26])).
% 20.08/3.05  cnf(d6, plain, 'set$udifference'(sK26,sK27) = 'empty$uset' | ~empty(X0) | X0 = 'set$udifference'(sK26,sK27), inference(resolution, [status(thm)], [d5,c5])).
% 20.08/3.05  cnf(d7, plain, 'empty$uset' = 'set$udifference'(sK26,sK27) | 'set$udifference'(sK26,sK27) = 'empty$uset', inference(resolution, [status(thm)], [d6,c15])).
% 20.08/3.05  cnf(d8, plain, 'empty$uset' != 'empty$uset' | 'empty$uset' = 'set$udifference'(sK26,sK27), inference(equality_factoring, [status(thm)], [d7])).
% 20.08/3.05  cnf(d9, plain, 'empty$uset' = 'set$udifference'(sK26,sK27), inference(equality_resolution, [status(thm)], [d8])).
% 20.08/3.05  cnf(d10, plain, in(X0,'empty$uset') | in(X0,sK27) | ~in(X0,sK26), inference(superposition, [status(thm)], [d9,d1])).
% 20.08/3.05  cnf(d11, plain, in(sK5(sK26,X0),'empty$uset') | in(sK5(sK26,X0),sK27) | subset(sK26,X0), inference(resolution, [status(thm)], [d10,c2])).
% 20.08/3.05  cnf(d12, plain, in(sK5(sK26,sK27),'empty$uset') | subset(sK26,sK27) | subset(sK26,sK27), inference(resolution, [status(thm)], [d11,c3])).
% 20.08/3.05  cnf(d13, plain, 'empty$uset' != 'empty$uset' | ~subset(sK26,sK27), inference(demodulation, [status(thm)], [c30,d9])).
% 20.08/3.05  cnf(d14, plain, ~subset(sK26,sK27), inference(equality_resolution, [status(thm)], [d13])).
% 20.08/3.05  cnf(d15, plain, in(sK5(sK26,sK27),'empty$uset'), inference(resolution, [status(thm)], [d14,d12])).
% 20.08/3.05  cnf(d16, plain, ~empty('empty$uset'), inference(resolution, [status(thm)], [d15,c26])).
% 20.08/3.05  cnf(d17, plain, $false, inference(resolution, [status(thm)], [c15,d16])).
% 20.08/3.05  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------