↑ Up

FindProof---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : GRP195-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% 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 : Fri Sep 25 01:25:40 PM UTC 2026

% Result   : Unsatisfiable 6.45s 1.31s
% Output   : CNFRefutation 6.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   27 (  27 unt;   0 nHn;  12 RR)
%            Number of literals    :   27 (  26 equ;  11 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    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   43 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t0,axiom,
    multiply(X1,multiply(X2,X2)) = multiply(X2,multiply(X2,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t3,plain,
    multiply(X1,multiply(X2,X2)) = multiply(X2,multiply(X2,X1)),
    inference(orient,[status(thm)],[t0]) ).

cnf(t1,axiom,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t2,plain,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    inference(orient,[status(thm)],[t1]) ).

cnf(t5,plain,
    multiply(multiply(X1,X2),multiply(multiply(X1,X2),X3)) = multiply(X3,multiply(X1,multiply(X2,multiply(X1,X2)))),
    inference(cp,[status(thm)],[t3,t2]) ).

cnf(t186,plain,
    multiply(X1,multiply(X2,multiply(multiply(X1,X2),X3))) = multiply(X3,multiply(X1,multiply(X2,multiply(X1,X2)))),
    inference(step,[status(thm)],[t5,t2]) ).

cnf(t187,plain,
    multiply(X1,multiply(X2,multiply(X1,multiply(X2,X3)))) = multiply(X3,multiply(X1,multiply(X2,multiply(X1,X2)))),
    inference(step,[status(thm)],[t186,t2]) ).

cnf(t106,plain,
    multiply(X1,multiply(X2,multiply(X1,multiply(X2,X3)))) = multiply(X3,multiply(X1,multiply(X2,multiply(X1,X2)))),
    inference(orient,[status(thm)],[t187]) ).

cnf(t6,plain,
    multiply(X1,multiply(multiply(X2,X2),X3)) = multiply(multiply(X2,multiply(X2,X1)),X3),
    inference(cp,[status(thm)],[t2,t3]) ).

cnf(t183,plain,
    multiply(X1,multiply(X2,multiply(X2,X3))) = multiply(multiply(X2,multiply(X2,X1)),X3),
    inference(step,[status(thm)],[t6,t2]) ).

cnf(t184,plain,
    multiply(X1,multiply(X2,multiply(X2,X3))) = multiply(X2,multiply(multiply(X2,X1),X3)),
    inference(step,[status(thm)],[t183,t2]) ).

cnf(t185,plain,
    multiply(X1,multiply(X2,multiply(X2,X3))) = multiply(X2,multiply(X2,multiply(X1,X3))),
    inference(step,[status(thm)],[t184,t2]) ).

cnf(t36,plain,
    multiply(X1,multiply(X2,multiply(X2,X3))) = multiply(X2,multiply(X2,multiply(X1,X3))),
    inference(orient,[status(thm)],[t185]) ).

cnf(t4,plain,
    multiply(X1,multiply(X1,multiply(X2,X3))) = multiply(X2,multiply(X3,multiply(X1,X1))),
    inference(cp,[status(thm)],[t3,t2]) ).

cnf(t12,plain,
    multiply(X1,multiply(X1,multiply(X2,X3))) = multiply(X2,multiply(X3,multiply(X1,X1))),
    inference(orient,[status(thm)],[t4]) ).

cnf(goal_0,negated_conjecture,
    multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))) != multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(g0_0,plain,
    multiply(a,multiply(b,multiply(a,multiply(b,multiply(b,multiply(a,multiply(b,a))))))) != multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))),
    inference(rw,[status(thm)],[goal_0,t106]) ).

cnf(g0_1,plain,
    multiply(a,multiply(b,multiply(b,multiply(b,multiply(a,multiply(a,multiply(b,a))))))) != multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))),
    inference(rw,[status(thm)],[g0_0,t36]) ).

cnf(g0_2,plain,
    multiply(b,multiply(b,multiply(a,multiply(b,multiply(a,multiply(a,multiply(b,a))))))) != multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))),
    inference(rw,[status(thm)],[g0_1,t36]) ).

cnf(g0_3,plain,
    multiply(b,multiply(b,multiply(a,multiply(b,multiply(b,multiply(a,multiply(a,a))))))) != multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))),
    inference(rw,[status(thm)],[g0_2,t36]) ).

cnf(g0_4,plain,
    multiply(b,multiply(b,multiply(a,multiply(b,multiply(b,multiply(a,multiply(a,a))))))) != multiply(a,multiply(a,multiply(b,multiply(a,multiply(a,multiply(b,multiply(b,b))))))),
    inference(rw,[status(thm)],[g0_3,t36]) ).

cnf(g0_5,plain,
    multiply(b,multiply(b,multiply(a,multiply(b,multiply(b,multiply(a,multiply(a,a))))))) != multiply(b,multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,b))))))),
    inference(rw,[status(thm)],[g0_4,t36]) ).

cnf(g0_6,plain,
    multiply(b,multiply(b,multiply(a,multiply(b,multiply(b,multiply(a,multiply(a,a))))))) != multiply(b,multiply(a,multiply(a,multiply(b,multiply(a,multiply(a,multiply(b,b))))))),
    inference(rw,[status(thm)],[g0_5,t36]) ).

cnf(g0_7,plain,
    multiply(b,multiply(b,multiply(a,multiply(b,multiply(b,multiply(a,multiply(a,a))))))) != multiply(b,multiply(b,multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,b))))))),
    inference(rw,[status(thm)],[g0_6,t36]) ).

cnf(g0_8,plain,
    multiply(b,multiply(b,multiply(a,multiply(b,multiply(b,multiply(a,multiply(a,a))))))) != multiply(b,multiply(b,multiply(a,multiply(a,multiply(b,multiply(b,multiply(a,a))))))),
    inference(rw,[status(thm)],[g0_7,t12]) ).

cnf(g0_9,plain,
    multiply(b,multiply(b,multiply(a,multiply(b,multiply(b,multiply(a,multiply(a,a))))))) != multiply(b,multiply(b,multiply(a,multiply(b,multiply(b,multiply(a,multiply(a,a))))))),
    inference(rw,[status(thm)],[g0_8,t36]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP195-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n002.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Wed Sep 23 14:09:18 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.45/1.31  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.45/1.31  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------