%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP708-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n019.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:16 PM UTC 2026
% Result : Unsatisfiable 4.36s 1.19s
% Output : CNFRefutation 4.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% 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 : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 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 : 32 ( 0 sgn 32 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
fof(f7,axiom,
! [X2,X0,X1] : mult(X0,mult(X1,mult(X0,X2))) = mult(mult(X0,mult(X1,X0)),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
fof(f8,axiom,
! [X0] : mult(op_c,X0) = mult(X0,op_c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
fof(f9,axiom,
! [X0,X1] : mult(mult(op_c,op_c),mult(X0,X1)) = mult(mult(mult(op_c,op_c),X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
fof(f10,negated_conjecture,
mult(a,mult(b,op_c)) != mult(mult(a,b),op_c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f2]) ).
tcf(c_64,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f6]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X1,X0)),X2) = mult(X0,mult(X1,mult(X0,X2))),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,plain,
! [X0: $i] : mult(X0,op_c) = mult(op_c,X0),
inference(cnf_transformation,[],[f8]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] : mult(mult(mult(op_c,op_c),X0),X1) = mult(mult(op_c,op_c),mult(X0,X1)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_68,negated_conjecture,
mult(mult(a,b),op_c) != mult(a,mult(b,op_c)),
inference(cnf_transformation,[],[f10]) ).
tcf(c_1545,plain,
mult(mult(a,b),op_c) != mult(a,mult(op_c,b)),
inference(demodulation,[status(thm)],[c_68,c_66]) ).
tcf(c_1546,plain,
mult(op_c,mult(a,b)) != mult(a,mult(op_c,b)),
inference(demodulation,[status(thm)],[c_1545,c_66]) ).
tcf(c_1574,plain,
! [X0: $i,X1: $i] : mult(X0,mult(unit,mult(X0,X1))) = mult(mult(X0,X0),X1),
inference(superposition,[status(thm)],[c_64,c_65]) ).
tcf(c_1577,plain,
! [X0: $i,X1: $i] : mult(mult(op_c,mult(op_c,X0)),X1) = mult(op_c,mult(X0,mult(op_c,X1))),
inference(superposition,[status(thm)],[c_66,c_65]) ).
tcf(c_1600,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X0),X1) = mult(X0,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_1574,c_64]) ).
tcf(c_1613,plain,
! [X0: $i,X1: $i] : mult(mult(op_c,mult(op_c,X0)),X1) = mult(mult(op_c,op_c),mult(X0,X1)),
inference(demodulation,[status(thm)],[c_67,c_1600]) ).
tcf(c_1614,plain,
! [X0: $i,X1: $i] : mult(op_c,mult(X0,mult(op_c,X1))) = mult(op_c,mult(op_c,mult(X0,X1))),
inference(demodulation,[status(thm)],[c_1613,c_1577,c_1600]) ).
tcf(c_1649,plain,
! [X0: $i,X1: $i] : ld(op_c,mult(op_c,mult(X0,mult(op_c,X1)))) = mult(op_c,mult(X0,X1)),
inference(superposition,[status(thm)],[c_1614,c_60]) ).
tcf(c_1916,plain,
! [X0: $i,X1: $i] : mult(X0,mult(op_c,X1)) = mult(op_c,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_1649,c_60]) ).
tcf(c_2028,plain,
mult(op_c,mult(a,b)) != mult(op_c,mult(a,b)),
inference(demodulation,[status(thm)],[c_1546,c_1916]) ).
tcf(c_2029,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_2028]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP708-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.35 % Computer : n019.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Wed Sep 23 15:47:34 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.39 Running UEQ theorem proving
% 0.15/0.39 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40
% 0.15/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.40
% 0.15/0.40 % Detected problem language: tptp
% 0.15/0.41 % Proving...
% 4.36/1.19 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 4.36/1.19 % SZS status Started for theBenchmark.p
% 4.36/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 4.36/1.19
% 4.36/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.36/1.19
% 4.36/1.19 % ------ iProver source info
% 4.36/1.19
% 4.36/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 4.36/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.36/1.19 % git: non_committed_changes: false
% 4.36/1.19
% 4.36/1.19 % ------ Parsing...% successful
% 4.36/1.19
% 4.36/1.19
% 4.36/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.36/1.19 % ------ Proving...
% 4.36/1.19 % ------ Problem Properties
% 4.36/1.19
% 4.36/1.19 %
% 4.36/1.19 % clauses 10
% 4.36/1.19 % conjectures 1
% 4.36/1.19 % EPR 0
% 4.36/1.19 % Horn 10
% 4.36/1.19 % unary 10
% 4.36/1.19 % binary 0
% 4.36/1.19 % lits 10
% 4.36/1.19 % lits eq 10
% 4.36/1.19 % fd_pure 0
% 4.36/1.19 % fd_pseudo 0
% 4.36/1.19 % fd_cond 0
% 4.36/1.19 % fd_pseudo_cond 0
% 4.36/1.19 % AC symbols 0
% 4.36/1.19
% 4.36/1.19 % ------ Input Options Time Limit: Unbounded
% 4.36/1.19
% 4.36/1.19
% 4.36/1.19 % ------
% 4.36/1.19 % Current options:
% 4.36/1.19 % ------
% 4.36/1.19
% 4.36/1.19
% 4.36/1.19 %
% 4.36/1.19
% 4.36/1.19 % ------ Proving...
% 4.36/1.19 %
% 4.36/1.19
% 4.36/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 4.36/1.19
% 4.36/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.36/1.19
% 4.36/1.19
%------------------------------------------------------------------------------