↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 16.70s 2.82s
% Output   : CNFRefutation 16.70s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU119+2 : 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.09/0.35  % Computer : n014.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 26 08:37:16 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.70/2.82  % SZS status Theorem for theBenchmark.p
% 16.70/2.82  % SZS output start CNFRefutation for theBenchmark.p
% 16.70/2.82  fof(commutativity_k3_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0)).
% 16.70/2.82  fof(d1_xboole_0, axiom, ! [X0] : ((X0 = 'empty$uset' <=> ! [X1] : ~in(X1,X0)))).
% 16.70/2.82  fof(d3_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$uintersection2'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & in(X3,X1))))))).
% 16.70/2.82  fof(d7_xboole_0, axiom, ! [X0] : ! [X1] : ((disjoint(X0,X1) <=> 'set$uintersection2'(X0,X1) = 'empty$uset'))).
% 16.70/2.82  fof(t3_xboole_0, conjecture, ! [X0] : ! [X1] : ((~((~disjoint(X0,X1) & ! [X2] : ~((in(X2,X0) & in(X2,X1))))) & ~((? [X2] : ((in(X2,X0) & in(X2,X1))) & disjoint(X0,X1)))))).
% 16.70/2.82  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ((~((~disjoint(X0,X1) & ! [X2] : ~((in(X2,X0) & in(X2,X1))))) & ~((? [X2] : ((in(X2,X0) & in(X2,X1))) & disjoint(X0,X1))))), inference(negate_conjecture, [status(cth)], [t3_xboole_0])).
% 16.70/2.82  cnf(c1, plain, 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0), inference(clausification, [status(esa)], [commutativity_k3_xboole_0])).
% 16.70/2.82  cnf(c2, plain, X0 != 'empty$uset' | ~in(X1,X0), inference(clausification, [status(esa)], [d1_xboole_0])).
% 16.70/2.82  cnf(c4, plain, X0 != 'set$uintersection2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 16.70/2.82  cnf(c5, plain, X0 = 'set$uintersection2'(X1,X2) | ~X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 16.70/2.82  cnf(c8, plain, ~X0(X1,X2,X3) | in(X4,X3) | ~in(X4,X1) | ~in(X4,X2), inference(clausification, [status(esa)], [d3_xboole_0])).
% 16.70/2.82  cnf(c10, plain, X0(X1,X2,X3) | in(sK12(X1,X2,X3),X3) | in(sK12(X1,X2,X3),X1), inference(clausification, [status(esa)], [d3_xboole_0])).
% 16.70/2.82  cnf(c11, plain, X0(X1,X2,X3) | in(sK12(X1,X2,X3),X3) | in(sK12(X1,X2,X3),X2), inference(clausification, [status(esa)], [d3_xboole_0])).
% 16.70/2.82  cnf(c15, plain, ~disjoint(X0,X1) | 'set$uintersection2'(X0,X1) = 'empty$uset', inference(clausification, [status(esa)], [d7_xboole_0])).
% 16.70/2.82  cnf(c16, plain, disjoint(X0,X1) | 'set$uintersection2'(X0,X1) != 'empty$uset', inference(clausification, [status(esa)], [d7_xboole_0])).
% 16.70/2.82  cnf(c22, plain, ~disjoint(sK22,sK23) | ~X0(sK22,sK23), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.70/2.82  cnf(c23, plain, ~in(X0,sK22) | ~in(X0,sK23) | ~X1(sK22,sK23), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.70/2.82  cnf(c24, plain, X0(X1,X2) | in(sK25(X1,X2),X1), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.70/2.82  cnf(c25, plain, X0(X1,X2) | in(sK25(X1,X2),X2), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.70/2.82  cnf(c26, plain, X0(X1,X2) | disjoint(X1,X2), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.70/2.82  cnf(d0, plain, 'Ts7'(X0,X1,'set$uintersection2'(X0,X1)), inference(equality_resolution, [status(thm)], [c4])).
% 16.70/2.82  cnf(d1, plain, ~in(X0,sK22) | ~in(X0,sK23) | disjoint(sK22,sK23), inference(resolution, [status(thm)], [c23,c26])).
% 16.70/2.82  cnf(d2, plain, in(sK12(sK23,X0,X1),X1) | 'Ts7'(sK23,X0,X1) | ~in(sK12(sK23,X0,X1),sK22) | disjoint(sK22,sK23), inference(resolution, [status(thm)], [c10,d1])).
% 16.70/2.82  cnf(d3, plain, in(sK12(sK23,sK22,X0),X0) | 'Ts7'(sK23,sK22,X0) | disjoint(sK22,sK23) | in(sK12(sK23,sK22,X0),X0) | 'Ts7'(sK23,sK22,X0), inference(resolution, [status(thm)], [d2,c11])).
% 16.70/2.82  cnf(d4, plain, ~in(X0,'empty$uset'), inference(equality_resolution, [status(thm)], [c2])).
% 16.70/2.82  cnf(d5, plain, 'Ts7'(sK23,sK22,'empty$uset') | disjoint(sK22,sK23), inference(resolution, [status(thm)], [d4,d3])).
% 16.70/2.82  cnf(d6, plain, disjoint(sK22,sK23) | 'empty$uset' = 'set$uintersection2'(sK23,sK22), inference(resolution, [status(thm)], [d5,c5])).
% 16.70/2.82  cnf(d7, plain, 'empty$uset' = 'set$uintersection2'(sK22,sK23) | disjoint(sK22,sK23), inference(demodulation, [status(thm)], [d6,c1])).
% 16.70/2.82  cnf(d8, plain, 'empty$uset' = 'set$uintersection2'(sK22,sK23) | 'set$uintersection2'(sK22,sK23) = 'empty$uset', inference(resolution, [status(thm)], [d7,c15])).
% 16.70/2.82  cnf(d9, plain, 'empty$uset' != 'empty$uset' | 'empty$uset' = 'set$uintersection2'(sK22,sK23), inference(equality_factoring, [status(thm)], [d8])).
% 16.70/2.82  cnf(d10, plain, 'empty$uset' = 'set$uintersection2'(sK22,sK23), inference(equality_resolution, [status(thm)], [d9])).
% 16.70/2.82  cnf(d11, plain, 'Ts7'(sK22,sK23,'empty$uset'), inference(superposition, [status(thm)], [d10,d0])).
% 16.70/2.82  cnf(d12, plain, in(X0,'empty$uset') | ~in(X0,sK23) | ~in(X0,sK22), inference(resolution, [status(thm)], [d11,c8])).
% 16.70/2.82  cnf(d13, plain, ~in(X0,sK22) | ~in(X0,sK23), inference(resolution, [status(thm)], [d4,d12])).
% 16.70/2.82  cnf(d14, plain, ~in(sK25(X0,sK23),sK22) | 'Ts21'(X0,sK23), inference(resolution, [status(thm)], [d13,c25])).
% 16.70/2.82  cnf(d15, plain, 'Ts21'(sK22,sK23) | 'Ts21'(sK22,sK23), inference(resolution, [status(thm)], [d14,c24])).
% 16.70/2.82  cnf(d16, plain, 'empty$uset' != 'empty$uset' | disjoint(sK22,sK23), inference(superposition, [status(thm)], [d10,c16])).
% 16.70/2.82  cnf(d17, plain, disjoint(sK22,sK23), inference(equality_resolution, [status(thm)], [d16])).
% 16.70/2.82  cnf(d18, plain, ~'Ts21'(sK22,sK23), inference(resolution, [status(thm)], [d17,c22])).
% 16.70/2.82  cnf(d19, plain, $false, inference(resolution, [status(thm)], [d18,d15])).
% 16.70/2.82  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------