%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP669-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 : n016.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:35:09 PM UTC 2026
% Result : Unsatisfiable 9.30s 12.38s
% Output : CNFRefutation 9.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 24 unt; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 7 ( 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 52 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
fof(f7,axiom,
! [X2,X0,X1] : mult(X0,mult(X1,mult(X0,X2))) = mult(mult(mult(X0,X1),X0),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
fof(f8,axiom,
! [X2,X0,X1] : mult(X0,mult(X1,mult(X2,X1))) = mult(mult(mult(X0,X1),X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
fof(f10,axiom,
! [X2,X0,X1] : mult(mult(X0,X1),mult(X2,X0)) = mult(X0,mult(mult(X1,X2),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c10) ).
fof(f11,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(mult(mult(a,mult(b,c)),a),b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_65,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f6]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(mult(X0,X1),X0),X2) = mult(X0,mult(X1,mult(X0,X2))),
inference(cnf_transformation,[],[f7]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(mult(X0,X1),X2),X1) = mult(X0,mult(X1,mult(X2,X1))),
inference(cnf_transformation,[],[f8]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X1),mult(X2,X0)) = mult(X0,mult(mult(X1,X2),X0)),
inference(cnf_transformation,[],[f10]) ).
tcf(c_70,negated_conjecture,
mult(mult(mult(a,mult(b,c)),a),b) != mult(mult(a,b),mult(c,mult(a,b))),
inference(cnf_transformation,[],[f11]) ).
tcf(c_1774,plain,
! [X0: $i,X1: $i,X2: $i] : rd(mult(X0,mult(mult(X1,X2),X0)),mult(X2,X0)) = mult(X0,X1),
inference(superposition,[status(thm)],[c_69,c_63]) ).
tcf(c_1782,plain,
! [X0: $i,X1: $i] : mult(unit,mult(X0,mult(X1,X0))) = mult(mult(X0,X1),X0),
inference(superposition,[status(thm)],[c_65,c_67]) ).
tcf(c_1791,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(mult(X0,X1),mult(X2,mult(X0,mult(X3,X0)))) = mult(X0,mult(mult(X1,mult(mult(X2,X0),X3)),X0)),
inference(superposition,[status(thm)],[c_67,c_69]) ).
tcf(c_1792,plain,
mult(mult(a,b),mult(c,mult(a,b))) != mult(a,mult(mult(b,c),mult(a,b))),
inference(demodulation,[status(thm)],[c_70,c_66]) ).
tcf(c_1793,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X1),X0) = mult(X0,mult(X1,X0)),
inference(demodulation,[status(thm)],[c_1782,c_65]) ).
tcf(c_1796,plain,
mult(mult(a,b),mult(c,mult(a,b))) != mult(a,mult(b,mult(mult(c,a),b))),
inference(demodulation,[status(thm)],[c_1792,c_69]) ).
tcf(c_1797,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X1,X0)),X2) = mult(X0,mult(X1,mult(X0,X2))),
inference(demodulation,[status(thm)],[c_66,c_1793]) ).
tcf(c_1841,plain,
! [X0: $i,X1: $i,X2: $i] : rd(mult(X0,mult(X1,mult(X0,X2))),X2) = mult(X0,mult(X1,X0)),
inference(superposition,[status(thm)],[c_1797,c_63]) ).
tcf(c_2026,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : rd(mult(X0,mult(mult(X1,mult(X2,mult(X1,X3))),X0)),mult(X3,X0)) = mult(X0,mult(X1,mult(X2,X1))),
inference(superposition,[status(thm)],[c_1797,c_1774]) ).
tcf(c_4037,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : rd(mult(mult(X0,X1),mult(X2,mult(X0,mult(mult(X1,X3),X0)))),mult(X3,X0)) = mult(mult(X0,X1),mult(X2,mult(X0,X1))),
inference(superposition,[status(thm)],[c_69,c_1841]) ).
tcf(c_4249,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X1),mult(X2,mult(X0,X1))) = mult(X0,mult(X1,mult(mult(X2,X0),X1))),
inference(demodulation,[status(thm)],[c_4037,c_1791,c_2026]) ).
tcf(c_9624,plain,
$false,
inference(ground_joinability,[status(thm)],[c_1796,c_4249]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP669-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.18/10.45 % Computer : n016.cluster.edu
% 0.18/10.45 % Model : x86_64 x86_64
% 0.18/10.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/10.45 % Memory : 8046.5625MB
% 0.18/10.45 % OS : Linux 6.8.0-71-generic
% 0.18/10.46 % CPULimit : 300
% 0.18/10.46 % WCLimit : 300
% 0.18/10.46 % DateTime : Wed Sep 23 15:43:08 UTC 2026
% 0.18/10.46 % CPUTime :
% 0.18/10.46 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.23/10.50 Running UEQ theorem proving
% 0.23/10.50 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.23/10.52
% 0.23/10.52 % ======== iProver multi-core TPTP/SMT =========
% 0.23/10.52
% 0.23/10.52 % Detected problem language: tptp
% 0.23/10.53 % Proving...
% 9.30/12.38 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 9.30/12.38 % SZS status Started for theBenchmark.p
% 9.30/12.38 % SZS status Unsatisfiable for theBenchmark.p
% 9.30/12.38
% 9.30/12.38 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 9.30/12.38
% 9.30/12.38 % ------ iProver source info
% 9.30/12.38
% 9.30/12.38 % git: date: 2026-07-19 20:42:38 +0200
% 9.30/12.38 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 9.30/12.38 % git: non_committed_changes: false
% 9.30/12.38
% 9.30/12.38 % ------ Parsing...% successful
% 9.30/12.38
% 9.30/12.38
% 9.30/12.38 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 9.30/12.38 % ------ Proving...
% 9.30/12.38 % ------ Problem Properties
% 9.30/12.38
% 9.30/12.38 %
% 9.30/12.38 % clauses 11
% 9.30/12.38 % conjectures 1
% 9.30/12.38 % EPR 0
% 9.30/12.38 % Horn 11
% 9.30/12.38 % unary 11
% 9.30/12.38 % binary 0
% 9.30/12.38 % lits 11
% 9.30/12.38 % lits eq 11
% 9.30/12.38 % fd_pure 0
% 9.30/12.38 % fd_pseudo 0
% 9.30/12.38 % fd_cond 0
% 9.30/12.38 % fd_pseudo_cond 0
% 9.30/12.38 % AC symbols 0
% 9.30/12.38
% 9.30/12.38 % ------ Input Options Time Limit: Unbounded
% 9.30/12.38
% 9.30/12.38
% 9.30/12.38 % ------
% 9.30/12.38 % Current options:
% 9.30/12.38 % ------
% 9.30/12.38
% 9.30/12.38
% 9.30/12.38 %
% 9.30/12.38
% 9.30/12.38 % ------ Proving...
% 9.30/12.38 %
% 9.30/12.38
% 9.30/12.38 % SZS status Unsatisfiable for theBenchmark.p
% 9.30/12.38
% 9.30/12.38 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.30/12.38
% 9.30/12.38
%------------------------------------------------------------------------------