%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ALG235-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 : n003.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:55 PM UTC 2026
% Result : Unsatisfiable 1.88s 1.29s
% Output : CNFRefutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 19 unt; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 : 44 ( 0 sgn 44 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : mult(X0,mult(X1,mult(X0,X1))) = mult(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
fof(f2,plain,
! [X0,X1] : mult(X0,X1) = mult(X0,mult(X1,mult(X0,X1))),
inference(reorient_equations,[],[f1]) ).
fof(f3,axiom,
! [X2,X3,X0,X1] : mult(X0,mult(X1,mult(X2,X3))) = mult(X2,mult(X1,mult(X0,X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
fof(f4,axiom,
! [X2,X3,X0,X1] : mult(mult(X0,mult(X1,mult(X2,X1))),X3) = mult(X0,mult(X3,mult(mult(X2,X1),X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
fof(f5,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',goals) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X1,mult(X0,X1))) = mult(X0,X1),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(X0,mult(X1,mult(X2,X3))) = mult(X2,mult(X1,mult(X0,X3))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(mult(X0,mult(X1,mult(X2,X1))),X3) = mult(X0,mult(X3,mult(mult(X2,X1),X3))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_56,negated_conjecture,
mult(a,mult(b,mult(a,mult(c,mult(d,c))))) != mult(a,mult(b,mult(d,c))),
inference(cnf_transformation,[],[f5]) ).
tcf(c_68,plain,
mult(a,mult(c,mult(a,mult(b,mult(d,c))))) != mult(a,mult(b,mult(d,c))),
inference(demodulation,[status(thm)],[c_56,c_54]) ).
tcf(c_108,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(X1,mult(X2,mult(X1,X0)))) = mult(X2,mult(X1,X0)),
inference(superposition,[status(thm)],[c_53,c_54]) ).
tcf(c_121,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(X1,mult(X0,mult(mult(X1,X2),X2)))) = mult(X0,mult(X1,X2)),
inference(superposition,[status(thm)],[c_54,c_53]) ).
tcf(c_167,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X1),mult(X1,mult(X0,X1))) = mult(X0,X1),
inference(superposition,[status(thm)],[c_53,c_108]) ).
tcf(c_239,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X1,mult(mult(X0,X1),X1))) = mult(X0,X1),
inference(demodulation,[status(thm)],[c_167,c_54]) ).
tcf(c_460,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(X1,mult(mult(X0,X2),X1))) = mult(mult(X0,X2),X1),
inference(superposition,[status(thm)],[c_53,c_55]) ).
tcf(c_554,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X1),X1) = mult(X0,X1),
inference(demodulation,[status(thm)],[c_239,c_460]) ).
tcf(c_988,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(X1,mult(X0,mult(X1,X2)))) = mult(X0,mult(X1,X2)),
inference(demodulation,[status(thm)],[c_121,c_554]) ).
tcf(c_1002,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(X0,mult(X1,mult(X0,mult(X2,mult(X3,X1))))) = mult(X0,mult(X2,mult(X3,X1))),
inference(superposition,[status(thm)],[c_108,c_988]) ).
tcf(c_1024,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_68,c_1002]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG235-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.08/0.35 % Computer : n003.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 05:16:22 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running UEQ theorem proving
% 0.12/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.12/0.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 1.88/1.29 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.88/1.29 % SZS status Started for theBenchmark.p
% 1.88/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.88/1.29
% 1.88/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.88/1.29
% 1.88/1.29 % ------ iProver source info
% 1.88/1.29
% 1.88/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.88/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.88/1.29 % git: non_committed_changes: false
% 1.88/1.29
% 1.88/1.29 % ------ Parsing...% successful
% 1.88/1.29
% 1.88/1.29
% 1.88/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.88/1.29
% 1.88/1.29 % ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.88/1.29
% 1.88/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.88/1.29
% 1.88/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.88/1.29 % ------ Proving...
% 1.88/1.29 % ------ Problem Properties
% 1.88/1.29
% 1.88/1.29 %
% 1.88/1.29 % clauses 4
% 1.88/1.29 % conjectures 0
% 1.88/1.29 % EPR 0
% 1.88/1.29 % Horn 4
% 1.88/1.29 % unary 4
% 1.88/1.29 % binary 0
% 1.88/1.29 % lits 4
% 1.88/1.29 % lits eq 4
% 1.88/1.29 % fd_pure 0
% 1.88/1.29 % fd_pseudo 0
% 1.88/1.29 % fd_cond 0
% 1.88/1.29 % fd_pseudo_cond 0
% 1.88/1.29 % AC symbols 0
% 1.88/1.29
% 1.88/1.29 % ------ Input Options Time Limit: Unbounded
% 1.88/1.29
% 1.88/1.29
% 1.88/1.29 % ------
% 1.88/1.29 % Current options:
% 1.88/1.29 % ------
% 1.88/1.29
% 1.88/1.29
% 1.88/1.29 %
% 1.88/1.29
% 1.88/1.29 % ------ Proving...
% 1.88/1.29 %
% 1.88/1.29
% 1.88/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.88/1.29
% 1.88/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.88/1.29
% 1.88/1.29
%------------------------------------------------------------------------------