↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SEU129+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 : n004.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 32.36s 4.68s
% Output   : CNFRefutation 32.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SEU129+1 : 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.18/0.44  % Computer : n004.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:38:21 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.45  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 32.36/4.68  % SZS status Theorem for theBenchmark.p
% 32.36/4.68  % SZS output start CNFRefutation for theBenchmark.p
% 32.36/4.68  fof(commutativity_k3_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0)).
% 32.36/4.68  fof(d3_tarski, axiom, ! [X0] : ! [X1] : ((subset(X0,X1) <=> ! [X2] : ((in(X2,X0) => in(X2,X1)))))).
% 32.36/4.68  fof(d3_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$uintersection2'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & in(X3,X1))))))).
% 32.36/4.68  fof(t26_xboole_1, conjecture, ! [X0] : ! [X1] : ! [X2] : ((subset(X0,X1) => subset('set$uintersection2'(X0,X2),'set$uintersection2'(X1,X2))))).
% 32.36/4.68  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ! [X2] : ((subset(X0,X1) => subset('set$uintersection2'(X0,X2),'set$uintersection2'(X1,X2)))), inference(negate_conjecture, [status(cth)], [t26_xboole_1])).
% 32.36/4.68  cnf(c1, plain, 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0), inference(clausification, [status(esa)], [commutativity_k3_xboole_0])).
% 32.36/4.68  cnf(c2, plain, ~subset(X0,X1) | ~in(X2,X0) | in(X2,X1), inference(clausification, [status(esa)], [d3_tarski])).
% 32.36/4.68  cnf(c3, plain, subset(X0,X1) | in(sK7(X0,X1),X0), inference(clausification, [status(esa)], [d3_tarski])).
% 32.36/4.68  cnf(c4, plain, subset(X0,X1) | ~in(sK7(X0,X1),X1), inference(clausification, [status(esa)], [d3_tarski])).
% 32.36/4.68  cnf(c5, plain, X0 != 'set$uintersection2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 32.36/4.68  cnf(c7, plain, ~X0(X1,X2,X3) | ~in(X4,X3) | in(X4,X1), inference(clausification, [status(esa)], [d3_xboole_0])).
% 32.36/4.68  cnf(c8, plain, ~X0(X1,X2,X3) | ~in(X4,X3) | in(X4,X2), inference(clausification, [status(esa)], [d3_xboole_0])).
% 32.36/4.68  cnf(c9, plain, ~X0(X1,X2,X3) | in(X4,X3) | ~in(X4,X1) | ~in(X4,X2), inference(clausification, [status(esa)], [d3_xboole_0])).
% 32.36/4.68  cnf(c25, plain, subset(sK26,sK27), inference(clausification, [status(esa)], [negated_conjecture])).
% 32.36/4.68  cnf(c26, plain, ~subset('set$uintersection2'(sK26,sK28),'set$uintersection2'(sK27,sK28)), inference(clausification, [status(esa)], [negated_conjecture])).
% 32.36/4.68  cnf(d0, plain, 'Ts8'(X0,X1,'set$uintersection2'(X0,X1)), inference(equality_resolution, [status(thm)], [c5])).
% 32.36/4.68  cnf(d1, plain, ~in(X0,'set$uintersection2'(X1,X2)) | in(X0,X2), inference(resolution, [status(thm)], [d0,c8])).
% 32.36/4.68  cnf(d2, plain, in(sK7('set$uintersection2'(X0,X1),X2),X1) | subset('set$uintersection2'(X0,X1),X2), inference(resolution, [status(thm)], [d1,c3])).
% 32.36/4.68  cnf(d3, plain, in(X0,'set$uintersection2'(X1,X2)) | ~in(X0,X2) | ~in(X0,X1), inference(resolution, [status(thm)], [d0,c9])).
% 32.36/4.68  cnf(d4, plain, ~in(sK7(X0,'set$uintersection2'(X1,X2)),X2) | ~in(sK7(X0,'set$uintersection2'(X1,X2)),X1) | subset(X0,'set$uintersection2'(X1,X2)), inference(resolution, [status(thm)], [d3,c4])).
% 32.36/4.68  cnf(d5, plain, ~in(sK7('set$uintersection2'(X0,X1),'set$uintersection2'(X1,X2)),X2) | subset('set$uintersection2'(X0,X1),'set$uintersection2'(X1,X2)) | subset('set$uintersection2'(X0,X1),'set$uintersection2'(X1,X2)), inference(resolution, [status(thm)], [d4,d2])).
% 32.36/4.68  cnf(d6, plain, in(X0,sK27) | ~in(X0,sK26), inference(resolution, [status(thm)], [c2,c25])).
% 32.36/4.68  cnf(d7, plain, ~in(X0,'set$uintersection2'(X1,X2)) | in(X0,X1), inference(resolution, [status(thm)], [d0,c7])).
% 32.36/4.68  cnf(d8, plain, in(sK7('set$uintersection2'(X0,X1),X2),X0) | subset('set$uintersection2'(X0,X1),X2), inference(resolution, [status(thm)], [d7,c3])).
% 32.36/4.68  cnf(d9, plain, subset('set$uintersection2'(sK26,X0),X1) | in(sK7('set$uintersection2'(sK26,X0),X1),sK27), inference(resolution, [status(thm)], [d8,d6])).
% 32.36/4.68  cnf(d10, plain, subset('set$uintersection2'(sK26,X0),'set$uintersection2'(X0,sK27)) | subset('set$uintersection2'(sK26,X0),'set$uintersection2'(X0,sK27)), inference(resolution, [status(thm)], [d9,d5])).
% 32.36/4.68  cnf(d11, plain, subset('set$uintersection2'(sK26,X0),'set$uintersection2'(sK27,X0)), inference(superposition, [status(thm)], [c1,d10])).
% 32.36/4.68  cnf(d12, plain, $false, inference(resolution, [status(thm)], [d11,c26])).
% 32.36/4.68  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------