↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 18.85s 3.04s
% Output   : CNFRefutation 18.85s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET887+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.10/0.36  % Computer : n006.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 26 08:24:28 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.85/3.04  % SZS status Theorem for theBenchmark.p
% 18.85/3.04  % SZS output start CNFRefutation for theBenchmark.p
% 18.85/3.04  fof(commutativity_k2_tarski, axiom, ! [X0] : ! [X1] : 'unordered$upair'(X0,X1) = 'unordered$upair'(X1,X0)).
% 18.85/3.04  fof(d1_xboole_0, axiom, ! [X0] : ((X0 = 'empty$uset' <=> ! [X1] : ~in(X1,X0)))).
% 18.85/3.04  fof(d2_tarski, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'unordered$upair'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> (X3 = X0 | X3 = X1)))))).
% 18.85/3.04  fof(l46_zfmisc_1, axiom, ! [X0] : ! [X1] : ! [X2] : ((subset(X0,'unordered$upair'(X1,X2)) <=> ~((X0 != 'empty$uset' & (X0 != singleton(X1) & (X0 != singleton(X2) & X0 != 'unordered$upair'(X1,X2)))))))).
% 18.85/3.04  fof(t10_zfmisc_1, axiom, ! [X0] : ! [X1] : ! [X2] : ! [X3] : ~(('unordered$upair'(X0,X1) = 'unordered$upair'(X2,X3) & (X0 != X2 & X0 != X3)))).
% 18.85/3.04  fof(t8_zfmisc_1, axiom, ! [X0] : ! [X1] : ! [X2] : ((singleton(X0) = 'unordered$upair'(X1,X2) => X0 = X1))).
% 18.85/3.04  fof(t28_zfmisc_1, conjecture, ! [X0] : ! [X1] : ! [X2] : ! [X3] : ~((subset('unordered$upair'(X0,X1),'unordered$upair'(X2,X3)) & (X0 != X2 & X0 != X3)))).
% 18.85/3.04  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ! [X2] : ! [X3] : ~((subset('unordered$upair'(X0,X1),'unordered$upair'(X2,X3)) & (X0 != X2 & X0 != X3))), inference(negate_conjecture, [status(cth)], [t28_zfmisc_1])).
% 18.85/3.04  cnf(c1, plain, 'unordered$upair'(X0,X1) = 'unordered$upair'(X1,X0), inference(clausification, [status(esa)], [commutativity_k2_tarski])).
% 18.85/3.04  cnf(c2, plain, X0 != 'empty$uset' | ~in(X1,X0), inference(clausification, [status(esa)], [d1_xboole_0])).
% 18.85/3.04  cnf(c4, plain, X0 != 'unordered$upair'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d2_tarski])).
% 18.85/3.04  cnf(c5, plain, X0 = 'unordered$upair'(X1,X2) | ~X3(X1,X2,X0), inference(clausification, [status(esa)], [d2_tarski])).
% 18.85/3.04  cnf(c7, plain, ~X0(X1,X2,X3) | in(X4,X3) | X4 != X1, inference(clausification, [status(esa)], [d2_tarski])).
% 18.85/3.04  cnf(c16, plain, ~subset(X0,'unordered$upair'(X1,X2)) | X3(X0,X1,X2), inference(clausification, [status(esa)], [l46_zfmisc_1])).
% 18.85/3.04  cnf(c18, plain, ~X0(X1,X2,X3) | X1 = singleton(X3) | X1 = 'unordered$upair'(X2,X3) | X1 = 'empty$uset' | X1 = singleton(X2), inference(clausification, [status(esa)], [l46_zfmisc_1])).
% 18.85/3.04  cnf(c26, plain, 'unordered$upair'(X0,X1) != 'unordered$upair'(X2,X3) | X0 = X2 | X0 = X3, inference(clausification, [status(esa)], [t10_zfmisc_1])).
% 18.85/3.04  cnf(c27, plain, singleton(X0) != 'unordered$upair'(X1,X2) | X0 = X1, inference(clausification, [status(esa)], [t8_zfmisc_1])).
% 18.85/3.04  cnf(c28, plain, subset('unordered$upair'(sK28,sK29),'unordered$upair'(sK30,sK31)), inference(clausification, [status(esa)], [negated_conjecture])).
% 18.85/3.04  cnf(c29, plain, sK28 != sK30, inference(clausification, [status(esa)], [negated_conjecture])).
% 18.85/3.04  cnf(c30, plain, sK28 != sK31, inference(clausification, [status(esa)], [negated_conjecture])).
% 18.85/3.04  cnf(d0, plain, 'Ts7'(X0,X1,'unordered$upair'(X0,X1)), inference(equality_resolution, [status(thm)], [c4])).
% 18.85/3.04  cnf(d1, plain, in(X0,X1) | ~'Ts7'(X0,X2,X1), inference(equality_resolution, [status(thm)], [c7])).
% 18.85/3.04  cnf(d2, plain, in(X0,'unordered$upair'(X0,X1)), inference(resolution, [status(thm)], [d1,d0])).
% 18.85/3.04  cnf(d3, plain, 'Ts13'('unordered$upair'(sK28,sK29),sK30,sK31), inference(resolution, [status(thm)], [c16,c28])).
% 18.85/3.04  cnf(d4, plain, 'unordered$upair'(sK28,sK29) = 'unordered$upair'(sK30,sK31) | 'unordered$upair'(sK28,sK29) = 'empty$uset' | 'unordered$upair'(sK28,sK29) = singleton(sK31) | 'unordered$upair'(sK28,sK29) = singleton(sK30), inference(resolution, [status(thm)], [c18,d3])).
% 18.85/3.04  cnf(d5, plain, 'unordered$upair'(X0,X1) != 'unordered$upair'(sK28,sK29) | X0 = sK31 | X0 = sK30 | 'unordered$upair'(sK28,sK29) = 'empty$uset' | 'unordered$upair'(sK28,sK29) = singleton(sK30) | 'unordered$upair'(sK28,sK29) = singleton(sK31), inference(superposition, [status(thm)], [d4,c26])).
% 18.85/3.04  cnf(d6, plain, sK28 = sK30 | sK28 = sK31 | 'unordered$upair'(sK28,sK29) = 'empty$uset' | 'unordered$upair'(sK28,sK29) = singleton(sK30) | 'unordered$upair'(sK28,sK29) = singleton(sK31), inference(equality_resolution, [status(thm)], [d5])).
% 18.85/3.04  cnf(d7, plain, 'unordered$upair'(sK28,sK29) = 'empty$uset' | 'unordered$upair'(sK28,sK29) = singleton(sK30) | 'unordered$upair'(sK28,sK29) = singleton(sK31) | sK28 = sK31, inference(resolution, [status(thm)], [c29,d6])).
% 18.85/3.04  cnf(d8, plain, 'unordered$upair'(sK28,sK29) = 'empty$uset' | 'unordered$upair'(sK28,sK29) = singleton(sK30) | 'unordered$upair'(sK28,sK29) = singleton(sK31), inference(resolution, [status(thm)], [c30,d7])).
% 18.85/3.04  cnf(d9, plain, singleton(X0) != singleton(sK31) | X0 = sK28 | 'unordered$upair'(sK28,sK29) = 'empty$uset' | 'unordered$upair'(sK28,sK29) = singleton(sK30), inference(superposition, [status(thm)], [d8,c27])).
% 18.85/3.04  cnf(d10, plain, sK31 = sK28 | 'unordered$upair'(sK28,sK29) = 'empty$uset' | 'unordered$upair'(sK28,sK29) = singleton(sK30), inference(equality_resolution, [status(thm)], [d9])).
% 18.85/3.04  cnf(d11, plain, 'Ts7'(sK28,sK29,singleton(sK30)) | 'unordered$upair'(sK28,sK29) = 'empty$uset' | sK31 = sK28, inference(superposition, [status(thm)], [d10,d0])).
% 18.85/3.04  cnf(d12, plain, 'unordered$upair'(sK28,sK29) = 'empty$uset' | sK31 = sK28 | singleton(sK30) = 'unordered$upair'(sK28,sK29), inference(resolution, [status(thm)], [d11,c5])).
% 18.85/3.04  cnf(d13, plain, singleton(X2) != 'unordered$upair'(X1,X0) | X2 = X0, inference(superposition, [status(thm)], [c1,c27])).
% 18.85/3.04  cnf(d14, plain, singleton(X0) != singleton(sK30) | X0 = sK29 | 'unordered$upair'(sK28,sK29) = 'empty$uset' | sK31 = sK28, inference(superposition, [status(thm)], [d10,d13])).
% 18.85/3.04  cnf(d15, plain, sK30 = sK29 | 'unordered$upair'(sK28,sK29) = 'empty$uset' | sK31 = sK28, inference(equality_resolution, [status(thm)], [d14])).
% 18.85/3.04  cnf(d16, plain, in(sK28,'empty$uset') | sK30 = sK29 | sK31 = sK28, inference(superposition, [status(thm)], [d15,d2])).
% 18.85/3.04  cnf(d17, plain, ~in(X0,'empty$uset'), inference(equality_resolution, [status(thm)], [c2])).
% 18.85/3.04  cnf(d18, plain, sK30 = sK29 | sK31 = sK28, inference(resolution, [status(thm)], [d17,d16])).
% 18.85/3.04  cnf(d19, plain, singleton(sK30) = 'unordered$upair'(sK28,sK30) | 'unordered$upair'(sK28,sK29) = 'empty$uset' | sK31 = sK28 | sK31 = sK28, inference(superposition, [status(thm)], [d18,d12])).
% 18.85/3.04  cnf(d20, plain, in(sK28,'empty$uset') | singleton(sK30) = 'unordered$upair'(sK28,sK30) | sK31 = sK28, inference(superposition, [status(thm)], [d19,d2])).
% 18.85/3.04  cnf(d21, plain, singleton(sK30) = 'unordered$upair'(sK28,sK30) | sK31 = sK28, inference(resolution, [status(thm)], [d17,d20])).
% 18.85/3.04  cnf(d22, plain, singleton(X0) != singleton(sK30) | X0 = sK28 | sK31 = sK28, inference(superposition, [status(thm)], [d21,c27])).
% 18.85/3.04  cnf(d23, plain, sK30 = sK28 | sK31 = sK28, inference(equality_resolution, [status(thm)], [d22])).
% 18.85/3.04  cnf(d24, plain, sK28 != sK28 | sK30 = sK28, inference(superposition, [status(thm)], [d23,c30])).
% 18.85/3.04  cnf(d25, plain, sK30 = sK28, inference(equality_resolution, [status(thm)], [d24])).
% 18.85/3.04  cnf(d26, plain, sK28 != sK28, inference(demodulation, [status(thm)], [c29,d25])).
% 18.85/3.04  cnf(d27, plain, $false, inference(equality_resolution, [status(thm)], [d26])).
% 18.85/3.04  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------