↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 11.17s 1.95s
% Output   : CNFRefutation 11.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   28 (  28 unt;   0 nHn;   9 RR)
%            Number of literals    :   28 (  27 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   :   30 (   0 sgn)

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

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

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

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

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

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

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

cnf(c2,plain,
    inverse(X0) = 'double$udivide'(X0,identity),
    inference(clausification,[status(esa)],[inverse]) ).

cnf(c3,plain,
    identity = 'double$udivide'(X0,inverse(X0)),
    inference(clausification,[status(esa)],[identity]) ).

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

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

cnf(d1,plain,
    'double$udivide'('double$udivide'(X0,'double$udivide'('double$udivide'(identity,X1),'double$udivide'(X2,'double$udivide'(X1,X0)))),inverse(identity)) = X2,
    inference(demodulation,[status(thm)],[c0,c2]) ).

cnf(d2,plain,
    'double$udivide'('double$udivide'(identity,'double$udivide'('double$udivide'(identity,X0),'double$udivide'(X1,inverse(X0)))),inverse(identity)) = X1,
    inference(superposition,[status(thm)],[c2,d1]) ).

cnf(d3,plain,
    'double$udivide'('double$udivide'(identity,'double$udivide'('double$udivide'(identity,X0),identity)),inverse(identity)) = X0,
    inference(superposition,[status(thm)],[c3,d2]) ).

cnf(d4,plain,
    'double$udivide'('double$udivide'(identity,inverse('double$udivide'(identity,X0))),inverse(identity)) = X0,
    inference(demodulation,[status(thm)],[d3,c2]) ).

cnf(d5,plain,
    'double$udivide'('double$udivide'(identity,multiply(X0,identity)),inverse(identity)) = X0,
    inference(demodulation,[status(thm)],[d4,d0]) ).

cnf(d6,plain,
    multiply(inverse(X0),X0) = inverse(identity),
    inference(superposition,[status(thm)],[c3,d0]) ).

cnf(d7,plain,
    'double$udivide'('double$udivide'(identity,inverse(identity)),inverse(identity)) = inverse(identity),
    inference(superposition,[status(thm)],[d6,d5]) ).

cnf(d8,plain,
    'double$udivide'(identity,inverse(identity)) = inverse(identity),
    inference(demodulation,[status(thm)],[d7,c3]) ).

cnf(d9,plain,
    identity = inverse(identity),
    inference(demodulation,[status(thm)],[d8,c3]) ).

cnf(d10,plain,
    inverse(identity) != identity,
    inference(demodulation,[status(thm)],[c4,d6]) ).

cnf(d11,plain,
    identity != identity,
    inference(demodulation,[status(thm)],[d10,d9]) ).

cnf(d12,plain,
    multiply(identity,X0) = inverse(inverse(X0)),
    inference(superposition,[status(thm)],[c2,d0]) ).

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

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

cnf(d15,plain,
    identity = 'double$udivide'(inverse(X0),inverse(inverse(X0))),
    inference(demodulation,[status(thm)],[d14,d12]) ).

cnf(d16,plain,
    identity = identity,
    inference(demodulation,[status(thm)],[d15,c3]) ).

cnf(d17,plain,
    $false,
    inference(resolution,[status(thm)],[d16,d11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP581-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.37  % Computer : n026.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:03:25 UTC 2026
% 0.14/0.37  % CPUTime  : 
% 0.14/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.17/1.95  % SZS status Unsatisfiable for theBenchmark.p
% 11.17/1.95  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------