↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : GRP525-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 : n001.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 9.64s 4.45s
% Output   : CNFRefutation 9.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   40 (  40 unt;   0 nHn;   5 RR)
%            Number of literals    :   40 (  39 equ;   4 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   :  104 (   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_1,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ).

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(inverse(a1),a1) != multiply(inverse(b1),b1),
    inference(clausification,[status(esa)],[prove_these_axioms_1]) ).

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

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

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

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

cnf(d7,plain,
    divide(X2,X0) = divide(divide(X2,X3),divide(X0,X3)),
    inference(demodulation,[status(thm)],[d6,d4]) ).

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

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

cnf(d10,plain,
    divide(X2,X0) = divide(X4,divide(X0,divide(divide(X2,X3),divide(X4,X3)))),
    inference(demodulation,[status(thm)],[d9,d7]) ).

cnf(d11,plain,
    divide(X0,X3) = divide(X2,divide(X3,divide(X0,X2))),
    inference(demodulation,[status(thm)],[d10,d7]) ).

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

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

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

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

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

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

cnf(d18,plain,
    divide(X0,divide(X1,divide(divide(X2,X3),X2))) = divide(divide(X0,X1),X3),
    inference(demodulation,[status(thm)],[d17,d16]) ).

cnf(d19,plain,
    divide(X2,divide(X3,inverse(X1))) = divide(divide(X2,X3),X1),
    inference(demodulation,[status(thm)],[d18,d15]) ).

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

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

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

cnf(d23,plain,
    multiply(inverse(X2),X0) = divide(X1,divide(X2,divide(divide(X0,X3),divide(X1,X3)))),
    inference(superposition,[status(thm)],[d5,d22]) ).

cnf(d24,plain,
    multiply(inverse(X3),X0) = divide(X2,divide(X3,divide(X0,multiply(X1,divide(X2,X1))))),
    inference(demodulation,[status(thm)],[d23,d20]) ).

cnf(d25,plain,
    multiply(inverse(X2),X3) = divide(X1,divide(X2,divide(X3,divide(X1,divide(X0,X0))))),
    inference(demodulation,[status(thm)],[d24,d14]) ).

cnf(d26,plain,
    multiply(inverse(X2),X3) = divide(X0,divide(X2,divide(X3,X0))),
    inference(demodulation,[status(thm)],[d25,d12]) ).

cnf(d27,plain,
    multiply(inverse(X1),X2) = divide(X2,X1),
    inference(demodulation,[status(thm)],[d26,d11]) ).

cnf(d28,plain,
    divide(a1,a1) != multiply(inverse(b1),b1),
    inference(demodulation,[status(thm)],[c3,d27]) ).

cnf(d29,plain,
    divide(a1,a1) != divide(b1,b1),
    inference(demodulation,[status(thm)],[d28,d27]) ).

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

cnf(d31,plain,
    $false,
    inference(resolution,[status(thm)],[d30,d29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GRP525-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.42  % Computer : n001.cluster.edu
% 0.15/0.42  % Model    : x86_64 x86_64
% 0.15/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42  % Memory   : 8046.5625MB
% 0.15/0.42  % OS       : Linux 6.8.0-71-generic
% 0.15/0.42  % CPULimit : 300
% 0.15/0.43  % WCLimit  : 300
% 0.15/0.43  % DateTime : Fri Sep 25 15:04:26 UTC 2026
% 0.15/0.43  % CPUTime  : 
% 0.15/0.43  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.64/4.45  % SZS status Unsatisfiable for theBenchmark.p
% 9.64/4.45  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------