↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : ROB009-1 : TPTP v9.3.1. Released v1.0.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:26:49 AM UTC 2026

% Result   : Unsatisfiable 12.58s 2.19s
% Output   : CNFRefutation 12.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (  16 unt;   0 nHn;   8 RR)
%            Number of literals    :   16 (  15 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condition,hypothesis,
    negate(add(a,negate(add(b,c)))) = negate(add(b,negate(add(a,c)))) ).

cnf(prove_result,negated_conjecture,
    a != b ).

cnf(commutativity_of_add,axiom,
    add(X0,X1) = add(X1,X0) ).

cnf(associativity_of_add,axiom,
    add(add(X0,X1),X2) = add(X0,add(X1,X2)) ).

cnf(robbins_axiom,axiom,
    negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))) = X0 ).

cnf(c0,plain,
    negate(add(a,negate(add(b,c)))) = negate(add(b,negate(add(a,c)))),
    inference(clausification,[status(esa)],[condition]) ).

cnf(c1,plain,
    a != b,
    inference(clausification,[status(esa)],[prove_result]) ).

cnf(c2,plain,
    add(X0,X1) = add(X1,X0),
    inference(clausification,[status(esa)],[commutativity_of_add]) ).

cnf(c3,plain,
    add(add(X0,X1),X2) = add(X0,add(X1,X2)),
    inference(clausification,[status(esa)],[associativity_of_add]) ).

cnf(c4,plain,
    negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))) = X0,
    inference(clausification,[status(esa)],[robbins_axiom]) ).

cnf(d0,plain,
    add(X0,add(X1,X2)) = add(X2,add(X0,X1)),
    inference(superposition,[status(thm)],[c3,c2]) ).

cnf(d1,plain,
    add(X2,add(X1,X0)) = add(X1,add(X2,X0)),
    inference(superposition,[status(thm)],[c2,d0]) ).

cnf(d2,plain,
    negate(add(negate(add(b,add(a,c))),negate(add(a,negate(add(b,c)))))) = b,
    inference(superposition,[status(thm)],[c0,c4]) ).

cnf(d3,plain,
    negate(add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c)))))) = b,
    inference(demodulation,[status(thm)],[d2,d1]) ).

cnf(d4,plain,
    a = b,
    inference(demodulation,[status(thm)],[d3,c4]) ).

cnf(d5,plain,
    $false,
    inference(resolution,[status(thm)],[c1,d4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ROB009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.39  % Computer : n002.cluster.edu
% 0.08/0.39  % Model    : x86_64 x86_64
% 0.08/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.39  % Memory   : 8046.5625MB
% 0.08/0.39  % OS       : Linux 6.8.0-71-generic
% 0.08/0.39  % CPULimit : 300
% 0.08/0.39  % WCLimit  : 300
% 0.08/0.39  % DateTime : Sat Sep 26 06:17:08 UTC 2026
% 0.08/0.39  % CPUTime  : 
% 0.08/0.39  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.58/2.19  % SZS status Unsatisfiable for theBenchmark.p
% 12.58/2.19  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------