↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SEU131+2 : 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 : n015.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 30.37s 4.46s
% Output   : CNFRefutation 30.37s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SEU131+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44  % Computer : n015.cluster.edu
% 0.19/0.44  % Model    : x86_64 x86_64
% 0.19/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44  % Memory   : 8046.5625MB
% 0.19/0.44  % OS       : Linux 6.8.0-71-generic
% 0.19/0.44  % CPULimit : 300
% 0.19/0.44  % WCLimit  : 300
% 0.19/0.44  % DateTime : Sat Sep 26 08:41:58 UTC 2026
% 0.19/0.44  % CPUTime  : 
% 0.19/0.45  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.37/4.46  % SZS status Theorem for theBenchmark.p
% 30.37/4.46  % SZS output start CNFRefutation for theBenchmark.p
% 30.37/4.46  fof(d10_xboole_0, axiom, ! [X0] : ! [X1] : ((X0 = X1 <=> (subset(X0,X1) & subset(X1,X0))))).
% 30.37/4.46  fof(d1_xboole_0, axiom, ! [X0] : ((X0 = 'empty$uset' <=> ! [X1] : ~in(X1,X0)))).
% 30.37/4.46  fof(d3_tarski, axiom, ! [X0] : ! [X1] : ((subset(X0,X1) <=> ! [X2] : ((in(X2,X0) => in(X2,X1)))))).
% 30.37/4.46  fof(d4_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$udifference'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & ~in(X3,X1))))))).
% 30.37/4.46  fof(idempotence_k3_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uintersection2'(X0,X0) = X0).
% 30.37/4.46  fof(reflexivity_r1_tarski, axiom, ! [X0] : ! [X1] : subset(X0,X0)).
% 30.37/4.46  fof(t12_xboole_1, lemma, ! [X0] : ! [X1] : ((subset(X0,X1) => 'set$uunion2'(X0,X1) = X1))).
% 30.37/4.46  fof(t17_xboole_1, lemma, ! [X0] : ! [X1] : subset('set$uintersection2'(X0,X1),X0)).
% 30.37/4.46  fof(t7_xboole_1, lemma, ! [X0] : ! [X1] : subset(X0,'set$uunion2'(X0,X1))).
% 30.37/4.46  fof(l32_xboole_1, conjecture, ! [X0] : ! [X1] : (('set$udifference'(X0,X1) = 'empty$uset' <=> subset(X0,X1)))).
% 30.37/4.46  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : (('set$udifference'(X0,X1) = 'empty$uset' <=> subset(X0,X1))), inference(negate_conjecture, [status(cth)], [l32_xboole_1])).
% 30.37/4.46  cnf(c5, plain, X0 = X1 | ~subset(X0,X1) | ~subset(X1,X0), inference(clausification, [status(esa)], [d10_xboole_0])).
% 30.37/4.46  cnf(c6, plain, X0 != 'empty$uset' | ~in(X1,X0), inference(clausification, [status(esa)], [d1_xboole_0])).
% 30.37/4.46  cnf(c19, plain, ~subset(X0,X1) | ~in(X2,X0) | in(X2,X1), inference(clausification, [status(esa)], [d3_tarski])).
% 30.37/4.46  cnf(c20, plain, subset(X0,X1) | in(sK20(X0,X1),X0), inference(clausification, [status(esa)], [d3_tarski])).
% 30.37/4.46  cnf(c21, plain, subset(X0,X1) | ~in(sK20(X0,X1),X1), inference(clausification, [status(esa)], [d3_tarski])).
% 30.37/4.46  cnf(c33, plain, X0 != 'set$udifference'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d4_xboole_0])).
% 30.37/4.46  cnf(c34, plain, X0 = 'set$udifference'(X1,X2) | ~X3(X1,X2,X0), inference(clausification, [status(esa)], [d4_xboole_0])).
% 30.37/4.46  cnf(c37, plain, ~X0(X1,X2,X3) | in(X4,X3) | ~in(X4,X1) | in(X4,X2), inference(clausification, [status(esa)], [d4_xboole_0])).
% 30.37/4.46  cnf(c39, plain, X0(X1,X2,X3) | in(sK32(X1,X2,X3),X3) | in(sK32(X1,X2,X3),X1), inference(clausification, [status(esa)], [d4_xboole_0])).
% 30.37/4.46  cnf(c40, plain, X0(X1,X2,X3) | in(sK32(X1,X2,X3),X3) | ~in(sK32(X1,X2,X3),X2), inference(clausification, [status(esa)], [d4_xboole_0])).
% 30.37/4.46  cnf(c50, plain, 'set$uintersection2'(X0,X0) = X0, inference(clausification, [status(esa)], [idempotence_k3_xboole_0])).
% 30.37/4.46  cnf(c53, plain, subset(X0,X0), inference(clausification, [status(esa)], [reflexivity_r1_tarski])).
% 30.37/4.46  cnf(c55, plain, ~subset(X0,X1) | 'set$uunion2'(X0,X1) = X1, inference(clausification, [status(esa)], [t12_xboole_1])).
% 30.37/4.46  cnf(c56, plain, subset('set$uintersection2'(X0,X1),X0), inference(clausification, [status(esa)], [t17_xboole_1])).
% 30.37/4.46  cnf(c78, plain, subset(X0,'set$uunion2'(X0,X1)), inference(clausification, [status(esa)], [t7_xboole_1])).
% 30.37/4.46  cnf(c82, plain, 'set$udifference'(sK91,sK92) = 'empty$uset' | subset(sK91,sK92), inference(clausification, [status(esa)], [negated_conjecture])).
% 30.37/4.46  cnf(c83, plain, ~subset(sK91,sK92) | 'set$udifference'(sK91,sK92) != 'empty$uset', inference(clausification, [status(esa)], [negated_conjecture])).
% 30.37/4.46  cnf(d0, plain, ~in(X0,'empty$uset'), inference(equality_resolution, [status(thm)], [c6])).
% 30.37/4.46  cnf(d1, plain, in(X0,sK92) | ~in(X0,sK91) | 'set$udifference'(sK91,sK92) = 'empty$uset', inference(resolution, [status(thm)], [c19,c82])).
% 30.37/4.46  cnf(d2, plain, in(sK32(sK91,X0,X1),X1) | 'Ts27'(sK91,X0,X1) | 'set$udifference'(sK91,sK92) = 'empty$uset' | in(sK32(sK91,X0,X1),sK92), inference(resolution, [status(thm)], [c39,d1])).
% 30.37/4.46  cnf(d3, plain, 'set$udifference'(sK91,sK92) = 'empty$uset' | in(sK32(sK91,sK92,X0),X0) | 'Ts27'(sK91,sK92,X0) | in(sK32(sK91,sK92,X0),X0) | 'Ts27'(sK91,sK92,X0), inference(resolution, [status(thm)], [d2,c40])).
% 30.37/4.46  cnf(d4, plain, 'set$uunion2'(sK91,sK92) = sK92 | 'set$udifference'(sK91,sK92) = 'empty$uset', inference(resolution, [status(thm)], [c55,c82])).
% 30.37/4.46  cnf(d5, plain, X0 != 'empty$uset' | 'Ts27'(sK91,sK92,X0) | 'set$uunion2'(sK91,sK92) = sK92, inference(superposition, [status(thm)], [d4,c33])).
% 30.37/4.46  cnf(d6, plain, 'set$uunion2'(sK91,sK92) = sK92 | 'Ts27'(sK91,sK92,'empty$uset'), inference(equality_resolution, [status(thm)], [d5])).
% 30.37/4.46  cnf(d7, plain, 'set$uunion2'(sK91,sK92) = sK92 | in(X0,'empty$uset') | in(X0,sK92) | ~in(X0,sK91), inference(resolution, [status(thm)], [d6,c37])).
% 30.37/4.46  cnf(d8, plain, 'set$uunion2'(sK91,sK92) = sK92 | ~in(X0,sK91) | in(X0,sK92), inference(resolution, [status(thm)], [d0,d7])).
% 30.37/4.46  cnf(d9, plain, 'set$uunion2'(sK91,sK92) = sK92 | in(sK20(sK91,X0),sK92) | subset(sK91,X0), inference(resolution, [status(thm)], [d8,c20])).
% 30.37/4.46  cnf(d10, plain, 'set$uunion2'(sK91,sK92) = sK92 | subset(sK91,sK92) | subset(sK91,sK92), inference(resolution, [status(thm)], [d9,c21])).
% 30.37/4.46  cnf(d11, plain, 'set$uunion2'(sK91,sK92) = sK92 | 'set$uunion2'(sK91,sK92) = sK92, inference(resolution, [status(thm)], [d10,c55])).
% 30.37/4.46  cnf(d12, plain, subset(sK91,sK92), inference(superposition, [status(thm)], [d11,c78])).
% 30.37/4.46  cnf(d13, plain, 'set$udifference'(sK91,sK92) != 'empty$uset', inference(resolution, [status(thm)], [d12,c83])).
% 30.37/4.46  cnf(d14, plain, in(sK32(sK91,sK92,X0),X0) | 'Ts27'(sK91,sK92,X0), inference(resolution, [status(thm)], [d13,d3])).
% 30.37/4.46  cnf(d15, plain, 'Ts27'(sK91,sK92,'empty$uset'), inference(resolution, [status(thm)], [d14,d0])).
% 30.37/4.46  cnf(d16, plain, 'empty$uset' = 'set$udifference'(sK91,sK92), inference(resolution, [status(thm)], [d15,c34])).
% 30.37/4.46  cnf(d17, plain, 'empty$uset' != 'empty$uset', inference(demodulation, [status(thm)], [d13,d16])).
% 30.37/4.46  cnf(d18, plain, X0 = 'set$uintersection2'(X0,X1) | ~subset(X0,'set$uintersection2'(X0,X1)), inference(resolution, [status(thm)], [c56,c5])).
% 30.37/4.46  cnf(d19, plain, ~subset(X0,X0) | X0 = 'set$uintersection2'(X0,X0), inference(superposition, [status(thm)], [c50,d18])).
% 30.37/4.46  cnf(d20, plain, X0 = X0 | ~subset(X0,X0), inference(demodulation, [status(thm)], [d19,c50])).
% 30.37/4.46  cnf(d21, plain, X0 = X0, inference(resolution, [status(thm)], [c53,d20])).
% 30.37/4.46  cnf(d22, plain, $false, inference(resolution, [status(thm)], [d21,d17])).
% 30.37/4.46  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------