%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ALG245-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n015.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:53:56 PM UTC 2026
% Result : Unsatisfiable 8.21s 1.72s
% Output : CNFRefutation 8.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 23 unt; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 76 ( 0 sgn 76 !; 0 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : mult(X0,mult(X1,X2)) = mult(mult(X0,X1),mult(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
fof(f2,axiom,
! [X2,X0,X1] : mult(mult(X0,X1),X2) = mult(mult(X0,X2),mult(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
fof(f3,axiom,
! [X2,X3,X0,X1] : mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3)))) = mult(mult(X0,X2),mult(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
fof(f4,plain,
! [X2,X3,X0,X1] : mult(mult(X0,X2),mult(X1,X3)) = mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3)))),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X2,X3,X0,X1] : mult(mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3))),mult(mult(X0,X2),mult(X1,X3))) = mult(mult(X0,X1),mult(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
fof(f6,plain,
! [X2,X3,X0,X1] : mult(mult(X0,X1),mult(X2,X3)) = mult(mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3))),mult(mult(X0,X2),mult(X1,X3))),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X0] : mult(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
fof(f8,negated_conjecture,
mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) != mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X1),mult(X0,X2)) = mult(X0,mult(X1,X2)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X1),mult(X2,X1)) = mult(mult(X0,X2),X1),
inference(cnf_transformation,[],[f2]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3)))) = mult(mult(X0,X2),mult(X1,X3)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3))),mult(mult(X0,X2),mult(X1,X3))) = mult(mult(X0,X1),mult(X2,X3)),
inference(cnf_transformation,[],[f6]) ).
tcf(c_59,plain,
! [X0: $i] : mult(X0,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
tcf(c_60,negated_conjecture,
mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) != mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))),
inference(cnf_transformation,[],[f8]) ).
tcf(c_2061,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3))),X4)) = mult(mult(mult(X0,X2),mult(X1,X3)),mult(mult(mult(X0,X1),mult(X2,X3)),X4)),
inference(superposition,[status(thm)],[c_57,c_55]) ).
tcf(c_2064,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : mult(mult(X0,mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4)))),mult(mult(X1,X3),mult(X2,X4))) = mult(mult(X0,mult(mult(X1,X2),mult(X3,X4))),mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4)))),
inference(superposition,[status(thm)],[c_57,c_56]) ).
tcf(c_2119,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : mult(mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3))),mult(mult(mult(X0,X2),mult(X1,X3)),X4)) = mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3))),X4)),
inference(superposition,[status(thm)],[c_58,c_55]) ).
tcf(c_2123,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : mult(mult(X0,mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4)))),mult(mult(X1,X3),mult(X2,X4))) = mult(mult(X0,mult(mult(X1,X3),mult(X2,X4))),mult(mult(X1,X2),mult(X3,X4))),
inference(superposition,[status(thm)],[c_58,c_56]) ).
tcf(c_2149,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : mult(mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3))),mult(mult(mult(X0,X2),mult(X1,X3)),X4)) = mult(mult(mult(X0,X2),mult(X1,X3)),mult(mult(mult(X0,X1),mult(X2,X3)),X4)),
inference(demodulation,[status(thm)],[c_2119,c_2061]) ).
tcf(c_2150,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : mult(mult(X0,mult(mult(X1,X2),mult(X3,X4))),mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4)))) = mult(mult(X0,mult(mult(X1,X3),mult(X2,X4))),mult(mult(X1,X2),mult(X3,X4))),
inference(demodulation,[status(thm)],[c_2064,c_2123]) ).
tcf(c_2982,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X1),mult(X2,X3))),mult(mult(X0,X2),mult(X1,X3))) = mult(mult(mult(X0,X2),mult(X1,X3)),mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X1),mult(X2,X3)))),
inference(superposition,[status(thm)],[c_2150,c_2149]) ).
tcf(c_2983,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(mult(mult(X0,X1),mult(X2,X3)),mult(mult(X0,X2),mult(X1,X3))) = mult(mult(mult(X0,X2),mult(X1,X3)),mult(mult(X0,X1),mult(X2,X3))),
inference(demodulation,[status(thm)],[c_2982,c_55,c_59]) ).
tcf(c_2997,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_60,c_2983]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG245-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35 % Computer : n015.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 05:18:56 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.39 Running UEQ theorem proving
% 0.14/0.39 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40
% 0.14/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.40
% 0.14/0.40 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 8.21/1.72 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 8.21/1.72 % SZS status Started for theBenchmark.p
% 8.21/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 8.21/1.72
% 8.21/1.72 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.21/1.72
% 8.21/1.72 % ------ iProver source info
% 8.21/1.72
% 8.21/1.72 % git: date: 2026-07-19 20:42:38 +0200
% 8.21/1.72 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.21/1.72 % git: non_committed_changes: false
% 8.21/1.72
% 8.21/1.72 % ------ Parsing...% successful
% 8.21/1.72
% 8.21/1.72
% 8.21/1.72 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 8.21/1.72 % ------ Proving...
% 8.21/1.72 % ------ Problem Properties
% 8.21/1.72
% 8.21/1.72 %
% 8.21/1.72 % clauses 6
% 8.21/1.72 % conjectures 1
% 8.21/1.72 % EPR 0
% 8.21/1.72 % Horn 6
% 8.21/1.72 % unary 6
% 8.21/1.72 % binary 0
% 8.21/1.72 % lits 6
% 8.21/1.72 % lits eq 6
% 8.21/1.72 % fd_pure 0
% 8.21/1.72 % fd_pseudo 0
% 8.21/1.72 % fd_cond 0
% 8.21/1.72 % fd_pseudo_cond 0
% 8.21/1.72 % AC symbols 0
% 8.21/1.72
% 8.21/1.72 % ------ Input Options Time Limit: Unbounded
% 8.21/1.72
% 8.21/1.72
% 8.21/1.72 % ------
% 8.21/1.72 % Current options:
% 8.21/1.72 % ------
% 8.21/1.72
% 8.21/1.72
% 8.21/1.72 %
% 8.21/1.72
% 8.21/1.72 % ------ Proving...
% 8.21/1.72 %
% 8.21/1.72
% 8.21/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 8.21/1.72
% 8.21/1.72 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.21/1.72
% 8.21/1.72
%------------------------------------------------------------------------------