↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n006.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:51 AM UTC 2026

% Result   : Unsatisfiable 34.53s 16.04s
% Output   : CNFRefutation 34.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   14 (  11 unt;   0 nHn;   6 RR)
%            Number of literals    :   17 (  16 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(negative_equality_implies_positive_equality,hypothesis,
    ( X0 = X1
    | negate(X0) != negate(X1) ) ).

cnf(prove_huntingtons_axiom,negated_conjecture,
    add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b ).

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

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

cnf(c0,plain,
    ( X0 = X1
    | negate(X0) != negate(X1) ),
    inference(clausification,[status(esa)],[negative_equality_implies_positive_equality]) ).

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

cnf(c2,plain,
    add(X0,X1) = add(X1,X0),
    inference(clausification,[status(esa)],[commutativity_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,
    ( X2 = add(negate(add(X0,X1)),negate(add(X0,negate(X1))))
    | negate(X2) != X0 ),
    inference(superposition,[status(thm)],[c4,c0]) ).

cnf(d1,plain,
    X0 = add(negate(add(negate(X0),X1)),negate(add(negate(X0),negate(X1)))),
    inference(equality_resolution,[status(thm)],[d0]) ).

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

cnf(d3,plain,
    X0 = add(negate(add(X1,negate(X0))),negate(add(negate(X1),negate(X0)))),
    inference(superposition,[status(thm)],[c2,d2]) ).

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

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

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