↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n006.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 06:54:43 AM UTC 2026

% Result   : Unsatisfiable 45.85s 9.21s
% Output   : CNFRefutation 45.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   45 (  45 unt;   0 nHn;   3 RR)
%            Number of literals    :   45 (  44 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   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   :   97 (  23 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(l1,axiom,
    add(X0,multiply(X1,multiply(X0,X2))) = X0 ).

cnf(b1,axiom,
    multiply(add(X0,X1),add(X0,inverse(X1))) = X0 ).

cnf(l2,axiom,
    multiply(X0,add(X1,add(X0,X2))) = X0 ).

cnf(b2,axiom,
    add(multiply(X0,X1),multiply(X0,inverse(X1))) = X0 ).

cnf(commutativity_of_add,axiom,
    add(X0,X1) = add(X1,X0) ).

cnf(commutativity_of_multiply,axiom,
    multiply(X0,X1) = multiply(X1,X0) ).

cnf(associativity_of_add,axiom,
    add(add(X0,X1),X2) = add(X0,add(X1,X2)) ).

cnf(associativity_of_multiply,axiom,
    multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)) ).

cnf(prove_equal_inverse,negated_conjecture,
    add(b,inverse(b)) != add(a,inverse(a)) ).

cnf(c0,plain,
    add(X0,multiply(X1,multiply(X0,X2))) = X0,
    inference(clausification,[status(esa)],[l1]) ).

cnf(c2,plain,
    multiply(add(X0,X1),add(X0,inverse(X1))) = X0,
    inference(clausification,[status(esa)],[b1]) ).

cnf(c3,plain,
    multiply(X0,add(X1,add(X0,X2))) = X0,
    inference(clausification,[status(esa)],[l2]) ).

cnf(c5,plain,
    add(multiply(X0,X1),multiply(X0,inverse(X1))) = X0,
    inference(clausification,[status(esa)],[b2]) ).

cnf(c6,plain,
    add(X0,X1) = add(X1,X0),
    inference(clausification,[status(esa)],[commutativity_of_add]) ).

cnf(c7,plain,
    multiply(X0,X1) = multiply(X1,X0),
    inference(clausification,[status(esa)],[commutativity_of_multiply]) ).

cnf(c8,plain,
    add(add(X0,X1),X2) = add(X0,add(X1,X2)),
    inference(clausification,[status(esa)],[associativity_of_add]) ).

cnf(c9,plain,
    multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    inference(clausification,[status(esa)],[associativity_of_multiply]) ).

cnf(c10,plain,
    add(b,inverse(b)) != add(a,inverse(a)),
    inference(clausification,[status(esa)],[prove_equal_inverse]) ).

cnf(d0,plain,
    multiply(X0,add(X3,X0)) = X0,
    inference(superposition,[status(thm)],[c0,c3]) ).

cnf(d1,plain,
    add(X0,multiply(X3,X0)) = X0,
    inference(superposition,[status(thm)],[c3,c0]) ).

cnf(d2,plain,
    add(X1,multiply(X1,X0)) = X1,
    inference(superposition,[status(thm)],[c7,d1]) ).

cnf(d3,plain,
    add(X0,X0) = X0,
    inference(superposition,[status(thm)],[d0,d2]) ).

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

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

cnf(d6,plain,
    multiply(X0,multiply(X1,X0)) = multiply(X0,X1),
    inference(demodulation,[status(thm)],[d5,c9]) ).

cnf(d7,plain,
    multiply(X1,multiply(X1,X0)) = multiply(X1,X0),
    inference(superposition,[status(thm)],[c7,d6]) ).

cnf(d8,plain,
    multiply(X0,X0) = multiply(X0,add(X1,X0)),
    inference(superposition,[status(thm)],[d0,d7]) ).

cnf(d9,plain,
    X0 = multiply(X0,add(X1,X0)),
    inference(demodulation,[status(thm)],[d8,d4]) ).

cnf(d10,plain,
    X2 = multiply(X2,add(X0,add(X1,X2))),
    inference(superposition,[status(thm)],[c8,d9]) ).

cnf(d11,plain,
    add(X0,add(X1,X2)) = add(X2,add(X0,X1)),
    inference(superposition,[status(thm)],[c8,c6]) ).

cnf(d12,plain,
    add(X2,add(X1,X0)) = add(X1,add(X2,X0)),
    inference(superposition,[status(thm)],[c6,d11]) ).

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

cnf(d14,plain,
    add(X0,add(X1,multiply(X2,X0))) = add(X0,X1),
    inference(demodulation,[status(thm)],[d13,c8]) ).

cnf(d15,plain,
    add(X0,X2) = add(X0,add(multiply(X0,X1),X2)),
    inference(superposition,[status(thm)],[d2,c8]) ).

cnf(d16,plain,
    add(multiply(X1,X0),multiply(X0,inverse(X1))) = X0,
    inference(superposition,[status(thm)],[c7,c5]) ).

cnf(d17,plain,
    add(X0,multiply(X1,inverse(X0))) = add(X0,X1),
    inference(superposition,[status(thm)],[d16,d15]) ).

cnf(d18,plain,
    add(inverse(X0),add(X0,X1)) = add(inverse(X0),X0),
    inference(superposition,[status(thm)],[d17,d14]) ).

cnf(d19,plain,
    add(X0,add(inverse(X0),X1)) = add(inverse(X0),X0),
    inference(demodulation,[status(thm)],[d18,d12]) ).

cnf(d20,plain,
    add(X0,add(inverse(X0),X1)) = add(X0,inverse(X0)),
    inference(demodulation,[status(thm)],[d19,c6]) ).

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

cnf(d22,plain,
    multiply(X0,add(X2,add(X1,X0))) = X0,
    inference(superposition,[status(thm)],[c6,c3]) ).

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

cnf(d24,plain,
    X0 = multiply(add(X1,inverse(X1)),X0),
    inference(superposition,[status(thm)],[d23,c7]) ).

cnf(d25,plain,
    add(X0,inverse(X0)) = add(X1,inverse(X1)),
    inference(superposition,[status(thm)],[d24,d21]) ).

cnf(d26,plain,
    $false,
    inference(resolution,[status(thm)],[d25,c10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : BOO029-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38  % Computer : n006.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sat Sep 26 22:37:27 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 45.85/9.21  % SZS status Unsatisfiable for theBenchmark.p
% 45.85/9.21  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------