↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : GRP468-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 : n002.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:50 AM UTC 2026

% Result   : Unsatisfiable 2.03s 12.79s
% Output   : CNFRefutation 2.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   39 (  39 unt;   0 nHn;   3 RR)
%            Number of literals    :   39 (  38 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :  119 (   0 sgn)

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

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

cnf(prove_these_axioms_3,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ).

cnf(c0,plain,
    divide(divide(X0,X0),divide(X1,divide(divide(X2,divide(X3,X1)),inverse(X3)))) = X2,
    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(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    inference(clausification,[status(esa)],[prove_these_axioms_3]) ).

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

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

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

cnf(d3,plain,
    divide(X4,X4) = divide(X5,X5),
    inference(superposition,[status(thm)],[d2,d2]) ).

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

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

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

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

cnf(d8,plain,
    divide(divide(X2,X2),divide(X3,multiply(divide(X1,X1),X4))) = divide(X4,X3),
    inference(demodulation,[status(thm)],[d5,d7]) ).

cnf(d9,plain,
    divide(divide(X2,X2),divide(X3,X1)) = divide(X1,X3),
    inference(demodulation,[status(thm)],[d8,d7]) ).

cnf(d10,plain,
    divide(X2,inverse(X1)) = multiply(X2,X1),
    inference(superposition,[status(thm)],[d4,d1]) ).

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

cnf(d12,plain,
    divide(multiply(divide(X2,multiply(X3,X1)),X3),inverse(X1)) = X2,
    inference(demodulation,[status(thm)],[d11,d9]) ).

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

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

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

cnf(d16,plain,
    divide(divide(X1,X1),divide(X2,multiply(divide(X3,divide(X4,X4)),X2))) = X3,
    inference(demodulation,[status(thm)],[d15,d7]) ).

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

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

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

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

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

cnf(d22,plain,
    divide(X2,X2) = divide(X1,multiply(divide(X1,X3),X3)),
    inference(demodulation,[status(thm)],[d21,d7]) ).

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

cnf(d24,plain,
    multiply(divide(X0,X1),X1) = X0,
    inference(superposition,[status(thm)],[d23,d13]) ).

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

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

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

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

cnf(d29,plain,
    X2 = divide(multiply(divide(X2,divide(X3,X3)),X1),X1),
    inference(demodulation,[status(thm)],[d28,d9]) ).

cnf(d30,plain,
    X0 = divide(multiply(X0,X2),X2),
    inference(demodulation,[status(thm)],[d29,d25]) ).

cnf(d31,plain,
    multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    inference(superposition,[status(thm)],[d30,d13]) ).

cnf(d32,plain,
    $false,
    inference(resolution,[status(thm)],[d31,c2]) ).

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