↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : GRP446-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/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:47 AM UTC 2026

% Result   : Unsatisfiable 11.71s 2.13s
% Output   : CNFRefutation 11.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   25 (  25 unt;   0 nHn;   3 RR)
%            Number of literals    :   25 (  24 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   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   :   53 (   0 sgn)

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

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(divide(divide(X0,X0),X1),X2),divide(divide(divide(X0,X0),X0),X2))) = X1,
    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,
    inverse(X1) = divide(inverse(divide(X0,X0)),X1),
    inference(superposition,[status(thm)],[c2,c2]) ).

cnf(d2,plain,
    divide(X0,divide(divide(inverse(X1),X2),divide(divide(divide(X0,X0),X0),X2))) = X1,
    inference(demodulation,[status(thm)],[c0,c2]) ).

cnf(d3,plain,
    divide(X0,divide(divide(inverse(X1),X2),divide(inverse(X0),X2))) = X1,
    inference(demodulation,[status(thm)],[d2,c2]) ).

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

cnf(d5,plain,
    inverse(divide(divide(inverse(X2),X1),inverse(X1))) = X2,
    inference(demodulation,[status(thm)],[d4,d1]) ).

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

cnf(d7,plain,
    inverse(multiply(X1,divide(divide(inverse(X1),X2),divide(inverse(inverse(X0)),X2)))) = X0,
    inference(superposition,[status(thm)],[d3,d6]) ).

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

cnf(d9,plain,
    divide(X0,divide(X1,X1)) = X0,
    inference(superposition,[status(thm)],[d3,d8]) ).

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

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

cnf(d12,plain,
    inverse(inverse(X0)) = X0,
    inference(superposition,[status(thm)],[d11,d7]) ).

cnf(d13,plain,
    inverse(X1) = divide(multiply(inverse(X0),X0),X1),
    inference(superposition,[status(thm)],[d0,c2]) ).

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

cnf(d15,plain,
    multiply(multiply(inverse(X1),X1),X0) = X0,
    inference(demodulation,[status(thm)],[d14,d12]) ).

cnf(d16,plain,
    $false,
    inference(resolution,[status(thm)],[d15,c3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP446-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n016.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Fri Sep 25 14:59:44 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.71/2.13  % SZS status Unsatisfiable for theBenchmark.p
% 11.71/2.13  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------