%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : ALG235-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n007.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 12:52:11 PM UTC 2026
% Result : Unsatisfiable 3.25s 0.83s
% Output : CNFRefutation 3.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 6 RR)
% Number of literals : 10 ( 9 equ; 5 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; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t1,axiom,
mult(X1,mult(X2,mult(X3,X4))) = mult(X3,mult(X2,mult(X1,X4))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t5,plain,
mult(X1,mult(X2,mult(X3,X4))) = mult(X3,mult(X2,mult(X1,X4))),
inference(orient,[status(thm)],[t1]) ).
cnf(t0,axiom,
mult(X1,mult(X2,mult(X1,X2))) = mult(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t3,plain,
mult(X1,mult(X2,mult(X1,X2))) = mult(X1,X2),
inference(orient,[status(thm)],[t0]) ).
cnf(goal_0,negated_conjecture,
mult(a,mult(b,mult(a,mult(c,mult(d,c))))) != mult(a,mult(b,mult(d,c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
mult(a,mult(b,mult(a,mult(c,mult(d,c))))) != mult(d,mult(b,mult(a,c))),
inference(rw,[status(thm)],[goal_0,t5]) ).
cnf(g0_1,plain,
mult(a,mult(b,mult(d,mult(c,mult(a,c))))) != mult(d,mult(b,mult(a,c))),
inference(rw,[status(thm)],[g0_0,t5]) ).
cnf(g0_2,plain,
mult(d,mult(b,mult(a,mult(c,mult(a,c))))) != mult(d,mult(b,mult(a,c))),
inference(rw,[status(thm)],[g0_1,t5]) ).
cnf(g0_3,plain,
mult(d,mult(b,mult(a,c))) != mult(d,mult(b,mult(a,c))),
inference(rw,[status(thm)],[g0_2,t3]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG235-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.35 % Computer : n007.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Fri Sep 25 05:12:53 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.25/0.83 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.25/0.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------