↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n003.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:33:34 AM UTC 2026

% Result   : Theorem 10.48s 1.95s
% Output   : CNFRefutation 10.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET920+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n003.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 08:27:24 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.48/1.95  % SZS status Theorem for theBenchmark.p
% 10.48/1.95  % SZS output start CNFRefutation for theBenchmark.p
% 10.48/1.95  fof(commutativity_k3_xboole_0, axiom, ! [X0] : ! [X1] : 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0)).
% 10.48/1.95  fof(d2_tarski, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'unordered$upair'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (X3 = X0 | X3 = X1)))))).
% 10.48/1.95  fof(d3_xboole_0, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'set$uintersection2'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (in(X3,X0) & in(X3,X1))))))).
% 10.48/1.95  fof(t63_zfmisc_1, conjecture, ! [X0] : ! [X1] : ! [X2] : (('set$uintersection2'('unordered$upair'(X0,X1),X2) = 'unordered$upair'(X0,X1) => in(X0,X2)))).
% 10.48/1.95  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ! [X2] : (('set$uintersection2'('unordered$upair'(X0,X1),X2) = 'unordered$upair'(X0,X1) => in(X0,X2))), inference(negate_conjecture, [status(cth)], [t63_zfmisc_1])).
% 10.48/1.95  cnf(c2, plain, 'set$uintersection2'(X0,X1) = 'set$uintersection2'(X1,X0), inference(clausification, [status(esa)], [commutativity_k3_xboole_0])).
% 10.48/1.95  cnf(c3, plain, X0 != 'unordered$upair'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d2_tarski])).
% 10.48/1.95  cnf(c6, plain, ~X0(X1,X2,X3) | in(X4,X3) | X4 != X1, inference(clausification, [status(esa)], [d2_tarski])).
% 10.48/1.95  cnf(c14, plain, X0 != 'set$uintersection2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d3_xboole_0])).
% 10.48/1.95  cnf(c16, plain, ~X0(X1,X2,X3) | ~in(X4,X3) | in(X4,X1), inference(clausification, [status(esa)], [d3_xboole_0])).
% 10.48/1.95  cnf(c28, plain, 'set$uintersection2'('unordered$upair'(sK22,sK23),sK24) = 'unordered$upair'(sK22,sK23), inference(clausification, [status(esa)], [negated_conjecture])).
% 10.48/1.95  cnf(c29, plain, ~in(sK22,sK24), inference(clausification, [status(esa)], [negated_conjecture])).
% 10.48/1.95  cnf(d0, plain, 'set$uintersection2'(sK24,'unordered$upair'(sK22,sK23)) = 'unordered$upair'(sK22,sK23), inference(demodulation, [status(thm)], [c28,c2])).
% 10.48/1.95  cnf(d1, plain, X0 != 'unordered$upair'(sK22,sK23) | 'Ts12'(sK24,'unordered$upair'(sK22,sK23),X0), inference(superposition, [status(thm)], [d0,c14])).
% 10.48/1.95  cnf(d2, plain, 'Ts12'(sK24,'unordered$upair'(sK22,sK23),'unordered$upair'(sK22,sK23)), inference(equality_resolution, [status(thm)], [d1])).
% 10.48/1.95  cnf(d3, plain, in(X0,sK24) | ~in(X0,'unordered$upair'(sK22,sK23)), inference(resolution, [status(thm)], [c16,d2])).
% 10.48/1.95  cnf(d4, plain, 'Ts6'(X0,X1,'unordered$upair'(X0,X1)), inference(equality_resolution, [status(thm)], [c3])).
% 10.48/1.95  cnf(d5, plain, in(X0,X1) | ~'Ts6'(X0,X2,X1), inference(equality_resolution, [status(thm)], [c6])).
% 10.48/1.95  cnf(d6, plain, in(X0,'unordered$upair'(X0,X1)), inference(resolution, [status(thm)], [d5,d4])).
% 10.48/1.95  cnf(d7, plain, in(sK22,sK24), inference(resolution, [status(thm)], [d6,d3])).
% 10.48/1.95  cnf(d8, plain, $false, inference(resolution, [status(thm)], [c29,d7])).
% 10.48/1.95  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------