↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n016.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 07:23:57 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
    divide(X0,divide(divide(X0,X1),divide(X2,X1))) = X2 ).

cnf(multiply,axiom,
    multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)) ).

cnf(inverse,axiom,
    inverse(X0) = divide(divide(X1,X1),X0) ).

cnf(prove_these_axioms_2,negated_conjecture,
    multiply(multiply(inverse(b2),b2),a2) != a2 ).

cnf(c0,plain,
    divide(X0,divide(divide(X0,X1),divide(X2,X1))) = X2,
    inference(clausification,[status(esa)],[single_axiom]) ).

cnf(c1,plain,
    multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
    inference(clausification,[status(esa)],[multiply]) ).

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

cnf(c3,plain,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    inference(clausification,[status(esa)],[prove_these_axioms_2]) ).

cnf(d0,plain,
    multiply(X2,X1) = divide(X2,inverse(X1)),
    inference(demodulation,[status(thm)],[c1,c2]) ).

cnf(d1,plain,
    divide(X0,inverse(divide(X1,X0))) = X1,
    inference(superposition,[status(thm)],[c2,c0]) ).

cnf(d2,plain,
    multiply(X0,divide(X1,X0)) = X1,
    inference(demodulation,[status(thm)],[d1,d0]) ).

cnf(d3,plain,
    divide(X0,divide(X2,divide(X3,divide(divide(X0,X1),divide(X2,X1))))) = X3,
    inference(superposition,[status(thm)],[c0,c0]) ).

cnf(d4,plain,
    divide(X0,divide(X2,X2)) = X0,
    inference(superposition,[status(thm)],[c0,d3]) ).

cnf(d5,plain,
    multiply(divide(X1,X1),X0) = X0,
    inference(superposition,[status(thm)],[d4,d2]) ).

cnf(d6,plain,
    multiply(multiply(inverse(X0),X0),X1) = X1,
    inference(superposition,[status(thm)],[d0,d5]) ).

cnf(d7,plain,
    $false,
    inference(resolution,[status(thm)],[d6,c3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP526-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.34  % Computer : n016.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.34  % CPULimit : 300
% 0.07/0.34  % WCLimit  : 300
% 0.07/0.34  % DateTime : Fri Sep 25 15:03:30 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.94/2.15  % SZS status Unsatisfiable for theBenchmark.p
% 12.94/2.15  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------