↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SEU153+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n026.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:41:03 AM UTC 2026

% Result   : Theorem 8.77s 2.35s
% Output   : CNFRefutation 8.77s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU153+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37  % Computer : n026.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sat Sep 26 08:43:56 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.77/2.35  % SZS status Theorem for theBenchmark.p
% 8.77/2.35  % SZS output start CNFRefutation for theBenchmark.p
% 8.77/2.35  fof(commutativity_k3_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0)).
% 8.77/2.35  fof(d1_xboole_0, axiom, ! [X0] : ((X0 = 'empty$uset' <=> ! [X1] : ~in(X1,X0)))).
% 8.77/2.35  fof(d3_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$uintersection2'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & in(X3,X1))))))).
% 8.77/2.35  fof(d7_xboole_0, axiom, ! [X0] : ! [X1] : ((disjoint(X0,X1) <=> 'set$uintersection2'(X0,X1) = 'empty$uset'))).
% 8.77/2.35  fof(idempotence_k3_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uintersection2'(X0,X0) = X0).
% 8.77/2.35  fof(l2_zfmisc_1, lemma, ! [X0] : ! [X1] : ((subset(singleton(X0),X1) <=> in(X0,X1)))).
% 8.77/2.35  fof(t26_xboole_1, lemma, ! [X0] : ! [X1] : ! [X2] : ((subset(X0,X1) => subset('set$uintersection2'(X0,X2),'set$uintersection2'(X1,X2))))).
% 8.77/2.35  fof(l25_zfmisc_1, conjecture, ! [X0] : ! [X1] : ~((disjoint(singleton(X0),X1) & in(X0,X1)))).
% 8.77/2.35  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ~((disjoint(singleton(X0),X1) & in(X0,X1))), inference(negate_conjecture, [status(cth)], [l25_zfmisc_1])).
% 8.77/2.35  cnf(c4, plain, 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0), inference(clausification, [status(esa)], [commutativity_k3_xboole_0])).
% 8.77/2.35  cnf(c14, plain, X0 != 'empty$uset' | ~in(X1,X0), inference(clausification, [status(esa)], [d1_xboole_0])).
% 8.77/2.35  cnf(c47, plain, X0 != 'set$uintersection2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 8.77/2.35  cnf(c48, plain, X0 = 'set$uintersection2'(X1,X2) | ~X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 8.77/2.35  cnf(c69, plain, ~disjoint(X0,X1) | 'set$uintersection2'(X0,X1) = 'empty$uset', inference(clausification, [status(esa)], [d7_xboole_0])).
% 8.77/2.35  cnf(c78, plain, 'set$uintersection2'(X0,X0) = X0, inference(clausification, [status(esa)], [idempotence_k3_xboole_0])).
% 8.77/2.35  cnf(c82, plain, ~subset(singleton(X0),X1) | in(X0,X1), inference(clausification, [status(esa)], [l2_zfmisc_1])).
% 8.77/2.35  cnf(c83, plain, subset(singleton(X0),X1) | ~in(X0,X1), inference(clausification, [status(esa)], [l2_zfmisc_1])).
% 8.77/2.35  cnf(c101, plain, ~subset(X0,X1) | subset('set$uintersection2'(X0,X2),'set$uintersection2'(X1,X2)), inference(clausification, [status(esa)], [t26_xboole_1])).
% 8.77/2.35  cnf(c138, plain, disjoint(singleton(sK160),sK161), inference(clausification, [status(esa)], [negated_conjecture])).
% 8.77/2.35  cnf(c139, plain, in(sK160,sK161), inference(clausification, [status(esa)], [negated_conjecture])).
% 8.77/2.35  cnf(d0, plain, 'set$uintersection2'(singleton(sK160),sK161) = 'empty$uset', inference(resolution, [status(thm)], [c69,c138])).
% 8.77/2.35  cnf(d1, plain, 'set$uintersection2'(sK161,singleton(sK160)) = 'empty$uset', inference(demodulation, [status(thm)], [d0,c4])).
% 8.77/2.35  cnf(d2, plain, X0 != 'empty$uset' | 'Ts39'(sK161,singleton(sK160),X0), inference(superposition, [status(thm)], [d1,c47])).
% 8.77/2.35  cnf(d3, plain, 'Ts39'(sK161,singleton(sK160),'empty$uset'), inference(equality_resolution, [status(thm)], [d2])).
% 8.77/2.35  cnf(d4, plain, 'empty$uset' = 'set$uintersection2'(sK161,singleton(sK160)), inference(resolution, [status(thm)], [d3,c48])).
% 8.77/2.35  cnf(d5, plain, subset('set$uintersection2'(X0,singleton(sK160)),'empty$uset') | ~subset(X0,sK161), inference(superposition, [status(thm)], [d4,c101])).
% 8.77/2.35  cnf(d6, plain, subset(singleton(sK160),'empty$uset') | ~subset(singleton(sK160),sK161), inference(superposition, [status(thm)], [c78,d5])).
% 8.77/2.35  cnf(d7, plain, subset(singleton(sK160),'empty$uset') | ~in(sK160,sK161), inference(resolution, [status(thm)], [d6,c83])).
% 8.77/2.35  cnf(d8, plain, subset(singleton(sK160),'empty$uset'), inference(resolution, [status(thm)], [c139,d7])).
% 8.77/2.35  cnf(d9, plain, in(sK160,'empty$uset'), inference(resolution, [status(thm)], [d8,c82])).
% 8.77/2.35  cnf(d10, plain, ~in(X0,'empty$uset'), inference(equality_resolution, [status(thm)], [c14])).
% 8.77/2.35  cnf(d11, plain, $false, inference(resolution, [status(thm)], [d10,d9])).
% 8.77/2.35  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------