↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : GRP561-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 : n011.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:24:01 AM UTC 2026

% Result   : Unsatisfiable 19.36s 4.34s
% Output   : CNFRefutation 19.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   25 (  25 unt;   0 nHn;   5 RR)
%            Number of literals    :   25 (  24 equ;   4 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(divide(divide(X0,inverse(X1)),X2),divide(X0,X2)) = X1 ).

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

cnf(prove_these_axioms_1,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ).

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

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

cnf(c2,plain,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    inference(clausification,[status(esa)],[prove_these_axioms_1]) ).

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

cnf(d1,plain,
    divide(multiply(multiply(X0,X1),X2),divide(X0,inverse(X2))) = X1,
    inference(superposition,[status(thm)],[c1,d0]) ).

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

cnf(d3,plain,
    divide(X1,divide(multiply(X0,X1),multiply(X0,X2))) = X2,
    inference(superposition,[status(thm)],[d2,d0]) ).

cnf(d4,plain,
    divide(divide(multiply(divide(multiply(X0,X1),X2),X3),divide(X0,X2)),X1) = X3,
    inference(superposition,[status(thm)],[d0,d0]) ).

cnf(d5,plain,
    divide(divide(multiply(divide(multiply(divide(multiply(X0,X1),X2),X3),divide(X0,X2)),X4),X1),X3) = X4,
    inference(superposition,[status(thm)],[d4,d0]) ).

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

cnf(d7,plain,
    divide(divide(X3,inverse(X1)),X3) = X1,
    inference(superposition,[status(thm)],[d6,d5]) ).

cnf(d8,plain,
    divide(multiply(X0,X1),X0) = X1,
    inference(demodulation,[status(thm)],[d7,c1]) ).

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

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

cnf(d11,plain,
    multiply(multiply(inverse(X0),X1),X0) = X1,
    inference(superposition,[status(thm)],[d8,c1]) ).

cnf(d12,plain,
    X0 = divide(X1,multiply(inverse(X0),X1)),
    inference(superposition,[status(thm)],[d11,d10]) ).

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

cnf(d14,plain,
    divide(a1,a1) != multiply(inverse(b1),b1),
    inference(demodulation,[status(thm)],[c2,d13]) ).

cnf(d15,plain,
    divide(a1,a1) != divide(b1,b1),
    inference(demodulation,[status(thm)],[d14,d13]) ).

cnf(d16,plain,
    X0 = divide(X1,divide(X1,X0)),
    inference(demodulation,[status(thm)],[d12,d13]) ).

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

cnf(d18,plain,
    $false,
    inference(resolution,[status(thm)],[d17,d15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP561-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.07/0.35  % Computer : n011.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Fri Sep 25 14:59:58 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 19.36/4.34  % SZS status Unsatisfiable for theBenchmark.p
% 19.36/4.34  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------