↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n018.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:12:41 AM UTC 2026

% Result   : Theorem 16.05s 2.45s
% Output   : CNFRefutation 16.05s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM423+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n018.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 02:42:35 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.05/2.45  % SZS status Theorem for theBenchmark.p
% 16.05/2.45  % SZS output start CNFRefutation for theBenchmark.p
% 16.05/2.45  fof(mIntZero, axiom, aInteger0(sz00)).
% 16.05/2.45  fof(mAddNeg, axiom, ! [X0] : ((aInteger0(X0) => (sdtpldt0(X0,smndt0(X0)) = sz00 & sz00 = sdtpldt0(smndt0(X0),X0))))).
% 16.05/2.45  fof(mMulZero, axiom, ! [X0] : ((aInteger0(X0) => (sdtasdt0(X0,sz00) = sz00 & sz00 = sdtasdt0(sz00,X0))))).
% 16.05/2.45  fof(mDivisor, definition, ! [X0] : ((aInteger0(X0) => ! [X1] : ((aDivisorOf0(X1,X0) <=> (aInteger0(X1) & (X1 != sz00 & ? [X2] : ((aInteger0(X2) & sdtasdt0(X1,X2) = X0))))))))).
% 16.05/2.45  fof(mEquMod, definition, ! [X0] : ! [X1] : ! [X2] : (((aInteger0(X0) & (aInteger0(X1) & (aInteger0(X2) & X2 != sz00))) => (sdteqdtlpzmzozddtrp0(X0,X1,X2) <=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))))))).
% 16.05/2.45  fof(m__671, hypothesis, (aInteger0(xa) & (aInteger0(xq) & xq != sz00))).
% 16.05/2.45  fof(m__, conjecture, sdteqdtlpzmzozddtrp0(xa,xa,xq)).
% 16.05/2.45  fof(negated_conjecture, negated_conjecture, ~sdteqdtlpzmzozddtrp0(xa,xa,xq), inference(negate_conjecture, [status(cth)], [m__])).
% 16.05/2.45  cnf(c0, plain, aInteger0(sz00), inference(clausification, [status(esa)], [mIntZero])).
% 16.05/2.45  cnf(c9, plain, ~aInteger0(X0) | sdtpldt0(X0,smndt0(X0)) = sz00, inference(clausification, [status(esa)], [mAddNeg])).
% 16.05/2.45  cnf(c17, plain, ~aInteger0(X0) | sdtasdt0(X0,sz00) = sz00, inference(clausification, [status(esa)], [mMulZero])).
% 16.05/2.45  cnf(c23, plain, ~aInteger0(X0) | aDivisorOf0(X1,X0) | ~X2(X0,X1), inference(clausification, [status(esa)], [mDivisor])).
% 16.05/2.45  cnf(c28, plain, ~aInteger0(X0) | sdtasdt0(X0,X1) != X2 | X3(X2,X0) | X0 = sz00 | ~aInteger0(X1), inference(clausification, [status(esa)], [mDivisor])).
% 16.05/2.45  cnf(c30, plain, ~aDivisorOf0(X0,sdtpldt0(X1,smndt0(X2))) | ~aInteger0(X0) | ~aInteger0(X1) | sdteqdtlpzmzozddtrp0(X1,X2,X0) | ~aInteger0(X2) | X0 = sz00, inference(clausification, [status(esa)], [mEquMod])).
% 16.05/2.45  cnf(c31, plain, aInteger0(xa), inference(clausification, [status(esa)], [m__671])).
% 16.05/2.45  cnf(c32, plain, aInteger0(xq), inference(clausification, [status(esa)], [m__671])).
% 16.05/2.45  cnf(c33, plain, xq != sz00, inference(clausification, [status(esa)], [m__671])).
% 16.05/2.45  cnf(c34, plain, ~sdteqdtlpzmzozddtrp0(xa,xa,xq), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.05/2.45  cnf(d0, plain, sdtpldt0(xa,smndt0(xa)) = sz00, inference(resolution, [status(thm)], [c9,c31])).
% 16.05/2.45  cnf(d1, plain, ~aDivisorOf0(X0,sz00) | X0 = sz00 | ~aInteger0(X0) | ~aInteger0(xa) | ~aInteger0(xa) | sdteqdtlpzmzozddtrp0(xa,xa,X0), inference(superposition, [status(thm)], [d0,c30])).
% 16.05/2.45  cnf(d2, plain, X0 = sz00 | ~aInteger0(X0) | ~aDivisorOf0(X0,sz00) | sdteqdtlpzmzozddtrp0(xa,xa,X0), inference(resolution, [status(thm)], [c31,d1])).
% 16.05/2.45  cnf(d3, plain, xq = sz00 | ~aInteger0(xq) | ~aDivisorOf0(xq,sz00), inference(resolution, [status(thm)], [d2,c34])).
% 16.05/2.45  cnf(d4, plain, xq = sz00 | ~aDivisorOf0(xq,sz00), inference(resolution, [status(thm)], [c32,d3])).
% 16.05/2.45  cnf(d5, plain, ~aDivisorOf0(xq,sz00), inference(resolution, [status(thm)], [c33,d4])).
% 16.05/2.45  cnf(d6, plain, sdtasdt0(xq,sz00) = sz00, inference(resolution, [status(thm)], [c17,c32])).
% 16.05/2.45  cnf(d7, plain, sz00 != X0 | xq = sz00 | ~aInteger0(xq) | ~aInteger0(sz00) | 'Ts26'(X0,xq), inference(superposition, [status(thm)], [d6,c28])).
% 16.05/2.45  cnf(d8, plain, sz00 != X0 | xq = sz00 | ~aInteger0(xq) | 'Ts26'(X0,xq), inference(resolution, [status(thm)], [c0,d7])).
% 16.05/2.45  cnf(d9, plain, sz00 != X0 | xq = sz00 | 'Ts26'(X0,xq), inference(resolution, [status(thm)], [c32,d8])).
% 16.05/2.45  cnf(d10, plain, sz00 != X0 | 'Ts26'(X0,xq), inference(resolution, [status(thm)], [c33,d9])).
% 16.05/2.45  cnf(d11, plain, 'Ts26'(sz00,xq), inference(equality_resolution, [status(thm)], [d10])).
% 16.05/2.45  cnf(d12, plain, ~aInteger0(sz00) | aDivisorOf0(xq,sz00), inference(resolution, [status(thm)], [d11,c23])).
% 16.05/2.45  cnf(d13, plain, aDivisorOf0(xq,sz00), inference(resolution, [status(thm)], [c0,d12])).
% 16.05/2.45  cnf(d14, plain, $false, inference(resolution, [status(thm)], [d13,d5])).
% 16.05/2.45  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------