↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n014.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:08 AM UTC 2026

% Result   : Unsatisfiable 24.33s 6.33s
% Output   : CNFRefutation 24.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   36 (  36 unt;   0 nHn;   3 RR)
%            Number of literals    :   36 (  35 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   :   92 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
    inverse('double$udivide'(inverse('double$udivide'(X0,inverse('double$udivide'(X1,'double$udivide'(X0,X2))))),X2)) = X1 ).

cnf(multiply,axiom,
    multiply(X0,X1) = inverse('double$udivide'(X1,X0)) ).

cnf(prove_these_axioms_4,negated_conjecture,
    multiply(a,b) != multiply(b,a) ).

cnf(c0,plain,
    inverse('double$udivide'(inverse('double$udivide'(X0,inverse('double$udivide'(X1,'double$udivide'(X0,X2))))),X2)) = X1,
    inference(clausification,[status(esa)],[single_axiom]) ).

cnf(c1,plain,
    multiply(X0,X1) = inverse('double$udivide'(X1,X0)),
    inference(clausification,[status(esa)],[multiply]) ).

cnf(c2,plain,
    multiply(a,b) != multiply(b,a),
    inference(clausification,[status(esa)],[prove_these_axioms_4]) ).

cnf(d0,plain,
    multiply(X2,inverse('double$udivide'(X0,inverse('double$udivide'(X1,'double$udivide'(X0,X2)))))) = X1,
    inference(demodulation,[status(thm)],[c0,c1]) ).

cnf(d1,plain,
    multiply(X2,multiply(inverse('double$udivide'(X1,'double$udivide'(X0,X2))),X0)) = X1,
    inference(demodulation,[status(thm)],[d0,c1]) ).

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

cnf(d3,plain,
    multiply(X1,multiply(X3,X0)) = multiply(multiply('double$udivide'(X2,'double$udivide'(X0,X1)),X3),X2),
    inference(superposition,[status(thm)],[d2,d2]) ).

cnf(d4,plain,
    multiply('double$udivide'(X1,X2),multiply(X2,multiply(X3,X1))) = X3,
    inference(superposition,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    multiply('double$udivide'(multiply(X2,X0),'double$udivide'(X0,X1)),X2) = X1,
    inference(superposition,[status(thm)],[d4,d4]) ).

cnf(d6,plain,
    multiply('double$udivide'(multiply(X1,multiply(X2,X0)),X3),multiply(X3,X2)) = 'double$udivide'(X0,X1),
    inference(superposition,[status(thm)],[d4,d4]) ).

cnf(d7,plain,
    'double$udivide'(X1,multiply('double$udivide'(multiply(X0,X1),X2),X0)) = X2,
    inference(superposition,[status(thm)],[d6,d5]) ).

cnf(d8,plain,
    'double$udivide'(multiply(X1,X2),'double$udivide'(X2,multiply(X0,X1))) = X0,
    inference(superposition,[status(thm)],[d6,d7]) ).

cnf(d9,plain,
    multiply('double$udivide'(X1,multiply(X2,X0)),multiply(X0,X1)) = inverse(X2),
    inference(superposition,[status(thm)],[d8,c1]) ).

cnf(d10,plain,
    multiply('double$udivide'(X1,multiply('double$udivide'(multiply(X0,X1),'double$udivide'(X2,X3)),X4)),multiply(X3,multiply(X4,X2))) = X0,
    inference(superposition,[status(thm)],[d3,d4]) ).

cnf(d11,plain,
    X2 = inverse('double$udivide'(multiply(X2,multiply(X0,X1)),'double$udivide'(X1,X0))),
    inference(superposition,[status(thm)],[d10,d9]) ).

cnf(d12,plain,
    X0 = multiply('double$udivide'(X2,X1),multiply(X0,multiply(X1,X2))),
    inference(demodulation,[status(thm)],[d11,c1]) ).

cnf(d13,plain,
    'double$udivide'(X0,X1) = multiply('double$udivide'(multiply(X1,X0),X2),X2),
    inference(superposition,[status(thm)],[d12,d12]) ).

cnf(d14,plain,
    multiply(multiply('double$udivide'(multiply(X1,X0),X2),X1),X0) = inverse(X2),
    inference(superposition,[status(thm)],[d7,c1]) ).

cnf(d15,plain,
    multiply('double$udivide'(X1,X0),X1) = inverse(X0),
    inference(superposition,[status(thm)],[d13,d14]) ).

cnf(d16,plain,
    'double$udivide'(X1,X0) = inverse(multiply(X0,X1)),
    inference(superposition,[status(thm)],[d15,d13]) ).

cnf(d17,plain,
    'double$udivide'(X1,'double$udivide'(X1,X0)) = X0,
    inference(superposition,[status(thm)],[d13,d7]) ).

cnf(d18,plain,
    multiply('double$udivide'(X0,'double$udivide'(X0,multiply(X1,X2))),inverse(X1)) = X2,
    inference(superposition,[status(thm)],[d9,d4]) ).

cnf(d19,plain,
    multiply(multiply(X1,X2),inverse(X1)) = X2,
    inference(demodulation,[status(thm)],[d18,d17]) ).

cnf(d20,plain,
    multiply(X1,inverse(multiply(X0,X1))) = inverse(X0),
    inference(superposition,[status(thm)],[d19,d19]) ).

cnf(d21,plain,
    multiply(X1,'double$udivide'(X1,X0)) = inverse(X0),
    inference(demodulation,[status(thm)],[d20,d16]) ).

cnf(d22,plain,
    multiply(X2,multiply(multiply('double$udivide'(X1,X2),multiply(X3,X0)),X1)) = multiply(X3,X0),
    inference(superposition,[status(thm)],[d4,d3]) ).

cnf(d23,plain,
    multiply(X2,X3) = multiply(X2,X3),
    inference(demodulation,[status(thm)],[d22,d2]) ).

cnf(d24,plain,
    X2 = multiply('double$udivide'(multiply(X0,X1),'double$udivide'(X1,X2)),X0),
    inference(superposition,[status(thm)],[d5,d23]) ).

cnf(d25,plain,
    X2 = 'double$udivide'(X1,multiply('double$udivide'(multiply(X0,X1),X2),X0)),
    inference(superposition,[status(thm)],[d6,d24]) ).

cnf(d26,plain,
    X0 = 'double$udivide'(X1,'double$udivide'(X1,X0)),
    inference(superposition,[status(thm)],[d13,d25]) ).

cnf(d27,plain,
    multiply(X0,X1) = inverse('double$udivide'(X0,X1)),
    inference(superposition,[status(thm)],[d26,d21]) ).

cnf(d28,plain,
    multiply(X1,X0) = multiply(X0,X1),
    inference(superposition,[status(thm)],[d27,c1]) ).

cnf(d29,plain,
    $false,
    inference(resolution,[status(thm)],[d28,c2]) ).

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