↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n002.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:37 AM UTC 2026

% Result   : Theorem 13.62s 2.13s
% Output   : CNFRefutation 13.62s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET950+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n002.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 26 08:29:35 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.62/2.13  % SZS status Theorem for theBenchmark.p
% 13.62/2.13  % SZS output start CNFRefutation for theBenchmark.p
% 13.62/2.13  fof(d2_zfmisc_1, axiom, ! [X0] : ! [X1] : ! [X2] : ((X2 = 'cartesian$uproduct2'(X0,X1) <=> ! [X3] : ((in(X3,X2) <=> ? [X4] : ? [X5] : ((in(X4,X0) & (in(X5,X1) & X3 = 'ordered$upair'(X4,X5))))))))).
% 13.62/2.13  fof(d3_tarski, axiom, ! [X0] : ! [X1] : ((subset(X0,X1) <=> ! [X2] : ((in(X2,X0) => in(X2,X1)))))).
% 13.62/2.13  fof(t103_zfmisc_1, conjecture, ! [X0] : ! [X1] : ! [X2] : ! [X3] : ~((subset(X0,'cartesian$uproduct2'(X1,X2)) & (in(X3,X0) & ! [X4] : ! [X5] : ~((in(X4,X1) & (in(X5,X2) & X3 = 'ordered$upair'(X4,X5)))))))).
% 13.62/2.13  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ! [X2] : ! [X3] : ~((subset(X0,'cartesian$uproduct2'(X1,X2)) & (in(X3,X0) & ! [X4] : ! [X5] : ~((in(X4,X1) & (in(X5,X2) & X3 = 'ordered$upair'(X4,X5))))))), inference(negate_conjecture, [status(cth)], [t103_zfmisc_1])).
% 13.62/2.13  cnf(c2, plain, X0 != 'cartesian$uproduct2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d2_zfmisc_1])).
% 13.62/2.13  cnf(c4, plain, ~X0(X1,X2,X3) | ~in(X4,X3) | in(sK9(X1,X2,X4),X1), inference(clausification, [status(esa)], [d2_zfmisc_1])).
% 13.62/2.13  cnf(c5, plain, ~X0(X1,X2,X3) | ~in(X4,X3) | in(sK10(X1,X2,X4),X2), inference(clausification, [status(esa)], [d2_zfmisc_1])).
% 13.62/2.13  cnf(c6, plain, ~X0(X1,X2,X3) | ~in(X4,X3) | X4 = 'ordered$upair'(sK9(X1,X2,X4),sK10(X1,X2,X4)), inference(clausification, [status(esa)], [d2_zfmisc_1])).
% 13.62/2.13  cnf(c16, plain, ~subset(X0,X1) | ~in(X2,X0) | in(X2,X1), inference(clausification, [status(esa)], [d3_tarski])).
% 13.62/2.13  cnf(c24, plain, subset(sK30,'cartesian$uproduct2'(sK31,sK32)), inference(clausification, [status(esa)], [negated_conjecture])).
% 13.62/2.13  cnf(c25, plain, in(sK33,sK30), inference(clausification, [status(esa)], [negated_conjecture])).
% 13.62/2.13  cnf(c26, plain, ~in(X0,sK31) | ~in(X1,sK32) | sK33 != 'ordered$upair'(X0,X1), inference(clausification, [status(esa)], [negated_conjecture])).
% 13.62/2.13  cnf(d0, plain, in(X0,'cartesian$uproduct2'(sK31,sK32)) | ~in(X0,sK30), inference(resolution, [status(thm)], [c16,c24])).
% 13.62/2.13  cnf(d1, plain, 'Ts4'(X0,X1,'cartesian$uproduct2'(X0,X1)), inference(equality_resolution, [status(thm)], [c2])).
% 13.62/2.13  cnf(d2, plain, ~in(X0,'cartesian$uproduct2'(X1,X2)) | in(sK9(X1,X2,X0),X1), inference(resolution, [status(thm)], [d1,c4])).
% 13.62/2.13  cnf(d3, plain, ~in(X0,'cartesian$uproduct2'(X1,X2)) | in(sK10(X1,X2,X0),X2), inference(resolution, [status(thm)], [d1,c5])).
% 13.62/2.13  cnf(d4, plain, X0 = 'ordered$upair'(sK9(X1,X2,X0),sK10(X1,X2,X0)) | ~in(X0,'cartesian$uproduct2'(X1,X2)), inference(resolution, [status(thm)], [d1,c6])).
% 13.62/2.13  cnf(d5, plain, X0 = 'ordered$upair'(sK9(sK31,sK32,X0),sK10(sK31,sK32,X0)) | ~in(X0,sK30), inference(resolution, [status(thm)], [d4,d0])).
% 13.62/2.13  cnf(d6, plain, sK33 = 'ordered$upair'(sK9(sK31,sK32,sK33),sK10(sK31,sK32,sK33)), inference(resolution, [status(thm)], [d5,c25])).
% 13.62/2.13  cnf(d7, plain, sK33 != sK33 | ~in(sK10(sK31,sK32,sK33),sK32) | ~in(sK9(sK31,sK32,sK33),sK31), inference(superposition, [status(thm)], [d6,c26])).
% 13.62/2.13  cnf(d8, plain, ~in(sK9(sK31,sK32,sK33),sK31) | ~in(sK10(sK31,sK32,sK33),sK32), inference(equality_resolution, [status(thm)], [d7])).
% 13.62/2.13  cnf(d9, plain, ~in(sK9(sK31,sK32,sK33),sK31) | ~in(sK33,'cartesian$uproduct2'(sK31,sK32)), inference(resolution, [status(thm)], [d8,d3])).
% 13.62/2.13  cnf(d10, plain, ~in(sK33,'cartesian$uproduct2'(sK31,sK32)) | ~in(sK33,'cartesian$uproduct2'(sK31,sK32)), inference(resolution, [status(thm)], [d9,d2])).
% 13.62/2.13  cnf(d11, plain, ~in(sK33,sK30), inference(resolution, [status(thm)], [d10,d0])).
% 13.62/2.13  cnf(d12, plain, $false, inference(resolution, [status(thm)], [c25,d11])).
% 13.62/2.13  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------