↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SEU157+1 : 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 : n015.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:04 AM UTC 2026

% Result   : Theorem 13.31s 3.37s
% Output   : CNFRefutation 13.31s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU157+1 : 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.36  % Computer : n015.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:44:59 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.31/3.37  % SZS status Theorem for theBenchmark.p
% 13.31/3.37  % SZS output start CNFRefutation for theBenchmark.p
% 13.31/3.37  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.31/3.37  fof(t33_zfmisc_1, axiom, ! [X0] : ! [X1] : ! [X2] : ! [X3] : (('ordered$upair'(X0,X1) = 'ordered$upair'(X2,X3) => (X0 = X2 & X1 = X3)))).
% 13.31/3.37  fof(l55_zfmisc_1, conjecture, ! [X0] : ! [X1] : ! [X2] : ! [X3] : ((in('ordered$upair'(X0,X1),'cartesian$uproduct2'(X2,X3)) <=> (in(X0,X2) & in(X1,X3))))).
% 13.31/3.37  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ! [X2] : ! [X3] : ((in('ordered$upair'(X0,X1),'cartesian$uproduct2'(X2,X3)) <=> (in(X0,X2) & in(X1,X3)))), inference(negate_conjecture, [status(cth)], [l55_zfmisc_1])).
% 13.31/3.37  cnf(c2, plain, X0 != 'cartesian$uproduct2'(X1,X2) | X3(X1,X2,X0), inference(clausification, [status(esa)], [d2_zfmisc_1])).
% 13.31/3.37  cnf(c4, plain, ~X0(X1,X2,X3) | ~in(X4,X3) | in(sK9(X1,X2,X4),X1), inference(clausification, [status(esa)], [d2_zfmisc_1])).
% 13.31/3.37  cnf(c5, plain, ~X0(X1,X2,X3) | ~in(X4,X3) | in(sK10(X1,X2,X4),X2), inference(clausification, [status(esa)], [d2_zfmisc_1])).
% 13.31/3.37  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.31/3.37  cnf(c7, plain, ~in(X0,X1) | ~in(X2,X3) | ~X4(X1,X3,X5) | in(X6,X5) | X6 != 'ordered$upair'(X0,X2), inference(clausification, [status(esa)], [d2_zfmisc_1])).
% 13.31/3.37  cnf(c20, plain, 'ordered$upair'(X0,X1) != 'ordered$upair'(X2,X3) | X0 = X2, inference(clausification, [status(esa)], [t33_zfmisc_1])).
% 13.31/3.37  cnf(c21, plain, 'ordered$upair'(X0,X1) != 'ordered$upair'(X2,X3) | X1 = X3, inference(clausification, [status(esa)], [t33_zfmisc_1])).
% 13.31/3.37  cnf(c23, plain, in('ordered$upair'(sK28,sK29),'cartesian$uproduct2'(sK30,sK31)) | in(sK28,sK30), inference(clausification, [status(esa)], [negated_conjecture])).
% 13.31/3.37  cnf(c24, plain, in('ordered$upair'(sK28,sK29),'cartesian$uproduct2'(sK30,sK31)) | in(sK29,sK31), inference(clausification, [status(esa)], [negated_conjecture])).
% 13.31/3.37  cnf(c25, plain, ~in(sK28,sK30) | ~in(sK29,sK31) | ~in('ordered$upair'(sK28,sK29),'cartesian$uproduct2'(sK30,sK31)), inference(clausification, [status(esa)], [negated_conjecture])).
% 13.31/3.37  cnf(d0, plain, 'Ts4'(X0,X1,'cartesian$uproduct2'(X0,X1)), inference(equality_resolution, [status(thm)], [c2])).
% 13.31/3.37  cnf(d1, plain, ~in(X0,'cartesian$uproduct2'(X1,X2)) | in(sK10(X1,X2,X0),X2), inference(resolution, [status(thm)], [d0,c5])).
% 13.31/3.37  cnf(d2, plain, X0 = 'ordered$upair'(sK9(X1,X2,X0),sK10(X1,X2,X0)) | ~in(X0,'cartesian$uproduct2'(X1,X2)), inference(resolution, [status(thm)], [d0,c6])).
% 13.31/3.37  cnf(d3, plain, 'ordered$upair'(sK28,sK29) = 'ordered$upair'(sK9(sK30,sK31,'ordered$upair'(sK28,sK29)),sK10(sK30,sK31,'ordered$upair'(sK28,sK29))) | in(sK28,sK30), inference(resolution, [status(thm)], [d2,c23])).
% 13.31/3.37  cnf(d4, plain, 'ordered$upair'(sK28,sK29) = 'ordered$upair'(sK9(sK30,sK31,'ordered$upair'(sK28,sK29)),sK10(sK30,sK31,'ordered$upair'(sK28,sK29))) | in(sK29,sK31), inference(resolution, [status(thm)], [d2,c24])).
% 13.31/3.37  cnf(d5, plain, in('ordered$upair'(X0,X1),X2) | ~in(X1,X3) | ~in(X0,X4) | ~'Ts4'(X4,X3,X2), inference(equality_resolution, [status(thm)], [c7])).
% 13.31/3.37  cnf(d6, plain, ~in(X0,X1) | ~in(X2,X3) | in('ordered$upair'(X2,X0),'cartesian$uproduct2'(X3,X1)), inference(resolution, [status(thm)], [d5,d0])).
% 13.31/3.37  cnf(d7, plain, ~in(sK28,sK30) | ~in(sK29,sK31) | ~in(sK28,sK30) | ~in(sK29,sK31), inference(resolution, [status(thm)], [d6,c25])).
% 13.31/3.37  cnf(d8, plain, ~in(sK28,sK30) | 'ordered$upair'(sK28,sK29) = 'ordered$upair'(sK9(sK30,sK31,'ordered$upair'(sK28,sK29)),sK10(sK30,sK31,'ordered$upair'(sK28,sK29))), inference(resolution, [status(thm)], [d7,d4])).
% 13.31/3.37  cnf(d9, plain, 'ordered$upair'(sK28,sK29) = 'ordered$upair'(sK9(sK30,sK31,'ordered$upair'(sK28,sK29)),sK10(sK30,sK31,'ordered$upair'(sK28,sK29))) | 'ordered$upair'(sK28,sK29) = 'ordered$upair'(sK9(sK30,sK31,'ordered$upair'(sK28,sK29)),sK10(sK30,sK31,'ordered$upair'(sK28,sK29))), inference(resolution, [status(thm)], [d8,d3])).
% 13.31/3.37  cnf(d10, plain, 'ordered$upair'(X0,X1) != 'ordered$upair'(sK28,sK29) | X1 = sK10(sK30,sK31,'ordered$upair'(sK28,sK29)), inference(superposition, [status(thm)], [d9,c21])).
% 13.31/3.37  cnf(d11, plain, sK29 = sK10(sK30,sK31,'ordered$upair'(sK28,sK29)), inference(equality_resolution, [status(thm)], [d10])).
% 13.31/3.37  cnf(d12, plain, in(sK29,sK31) | ~in('ordered$upair'(sK28,sK29),'cartesian$uproduct2'(sK30,sK31)), inference(superposition, [status(thm)], [d11,d1])).
% 13.31/3.37  cnf(d13, plain, ~in(X0,'cartesian$uproduct2'(X1,X2)) | in(sK9(X1,X2,X0),X1), inference(resolution, [status(thm)], [d0,c4])).
% 13.31/3.37  cnf(d14, plain, 'ordered$upair'(sK28,sK29) != 'ordered$upair'(X0,X1) | sK9(sK30,sK31,'ordered$upair'(sK28,sK29)) = X0, inference(superposition, [status(thm)], [d9,c20])).
% 13.31/3.37  cnf(d15, plain, sK9(sK30,sK31,'ordered$upair'(sK28,sK29)) = sK28, inference(equality_resolution, [status(thm)], [d14])).
% 13.31/3.37  cnf(d16, plain, in(sK28,sK30) | ~in('ordered$upair'(sK28,sK29),'cartesian$uproduct2'(sK30,sK31)), inference(superposition, [status(thm)], [d15,d13])).
% 13.31/3.37  cnf(d17, plain, in(sK28,sK30) | in(sK28,sK30), inference(resolution, [status(thm)], [d16,c23])).
% 13.31/3.37  cnf(d18, plain, ~in(sK29,sK31), inference(resolution, [status(thm)], [d17,d7])).
% 13.31/3.37  cnf(d19, plain, ~in('ordered$upair'(sK28,sK29),'cartesian$uproduct2'(sK30,sK31)), inference(resolution, [status(thm)], [d18,d12])).
% 13.31/3.37  cnf(d20, plain, in('ordered$upair'(sK28,sK29),'cartesian$uproduct2'(sK30,sK31)), inference(resolution, [status(thm)], [d18,c24])).
% 13.31/3.37  cnf(d21, plain, $false, inference(resolution, [status(thm)], [d20,d19])).
% 13.31/3.37  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------