↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET799+4 : 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 : n001.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:15 AM UTC 2026

% Result   : Theorem 16.70s 2.58s
% Output   : CNFRefutation 16.70s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET799+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37  % Computer : n001.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:22:42 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.70/2.58  % SZS status Theorem for theBenchmark.p
% 16.70/2.58  % SZS output start CNFRefutation for theBenchmark.p
% 16.70/2.58  fof(subset, axiom, ! [X0] : ! [X1] : ((subset(X0,X1) <=> ! [X2] : ((member(X2,X0) => member(X2,X1)))))).
% 16.70/2.58  fof(upper_bound, axiom, ! [X0] : ! [X1] : ! [X2] : (('upper$ubound'(X2,X0,X1) <=> ! [X3] : ((member(X3,X1) => apply(X0,X3,X2)))))).
% 16.70/2.58  fof(least_upper_bound, axiom, ! [X0] : ! [X1] : ! [X2] : ! [X3] : (('least$uupper$ubound'(X0,X1,X2,X3) <=> (member(X0,X1) & ('upper$ubound'(X0,X2,X1) & ! [X4] : (((member(X4,X3) & 'upper$ubound'(X4,X2,X1)) => apply(X2,X0,X4)))))))).
% 16.70/2.58  fof(thIV11, conjecture, ! [X0] : ! [X1] : ((order(X0,X1) => ! [X2] : ! [X3] : (((subset(X2,X1) & (subset(X3,X1) & subset(X2,X3))) => ! [X4] : ! [X5] : ((('least$uupper$ubound'(X4,X2,X0,X1) & 'least$uupper$ubound'(X5,X3,X0,X1)) => apply(X0,X4,X5)))))))).
% 16.70/2.58  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ((order(X0,X1) => ! [X2] : ! [X3] : (((subset(X2,X1) & (subset(X3,X1) & subset(X2,X3))) => ! [X4] : ! [X5] : ((('least$uupper$ubound'(X4,X2,X0,X1) & 'least$uupper$ubound'(X5,X3,X0,X1)) => apply(X0,X4,X5))))))), inference(negate_conjecture, [status(cth)], [thIV11])).
% 16.70/2.58  cnf(c0, plain, ~subset(X0,X1) | ~member(X2,X0) | member(X2,X1), inference(clausification, [status(esa)], [subset])).
% 16.70/2.58  cnf(c57, plain, ~'upper$ubound'(X0,X1,X2) | ~member(X3,X2) | apply(X1,X3,X0), inference(clausification, [status(esa)], [upper_bound])).
% 16.70/2.58  cnf(c85, plain, ~'least$uupper$ubound'(X0,X1,X2,X3) | X4(X0,X3,X2,X1), inference(clausification, [status(esa)], [least_upper_bound])).
% 16.70/2.58  cnf(c87, plain, ~X0(X1,X2,X3,X4) | member(X1,X4), inference(clausification, [status(esa)], [least_upper_bound])).
% 16.70/2.58  cnf(c88, plain, ~X0(X1,X2,X3,X4) | 'upper$ubound'(X1,X3,X4), inference(clausification, [status(esa)], [least_upper_bound])).
% 16.70/2.58  cnf(c104, plain, subset(sK103,sK104), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.70/2.58  cnf(c105, plain, 'least$uupper$ubound'(sK105,sK103,sK101,sK102), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.70/2.58  cnf(c106, plain, 'least$uupper$ubound'(sK106,sK104,sK101,sK102), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.70/2.58  cnf(c107, plain, ~apply(sK101,sK105,sK106), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.70/2.58  cnf(d0, plain, 'Ts87'(sK106,sK102,sK101,sK104), inference(resolution, [status(thm)], [c85,c106])).
% 16.70/2.58  cnf(d1, plain, 'upper$ubound'(sK106,sK101,sK104), inference(resolution, [status(thm)], [c88,d0])).
% 16.70/2.58  cnf(d2, plain, ~member(X0,sK104) | apply(sK101,X0,sK106), inference(resolution, [status(thm)], [d1,c57])).
% 16.70/2.58  cnf(d3, plain, ~member(sK105,sK104), inference(resolution, [status(thm)], [d2,c107])).
% 16.70/2.58  cnf(d4, plain, 'Ts87'(sK105,sK102,sK101,sK103), inference(resolution, [status(thm)], [c85,c105])).
% 16.70/2.58  cnf(d5, plain, member(sK105,sK103), inference(resolution, [status(thm)], [c87,d4])).
% 16.70/2.58  cnf(d6, plain, ~subset(sK103,X0) | member(sK105,X0), inference(resolution, [status(thm)], [d5,c0])).
% 16.70/2.58  cnf(d7, plain, member(sK105,sK104), inference(resolution, [status(thm)], [d6,c104])).
% 16.70/2.58  cnf(d8, plain, $false, inference(resolution, [status(thm)], [d7,d3])).
% 16.70/2.58  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------