%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP028-4 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n017.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:29:58 PM UTC 2026
% Result : Unsatisfiable 2.66s 1.50s
% Output : CNFRefutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 9 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 21 ( 12 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 0 con; 1-2 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1,X4,X5] :
( product(X2,X3,X5)
| ~ product(X0,X4,X5)
| ~ product(X1,X3,X4)
| ~ product(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity1) ).
fof(f3,axiom,
! [X0,X1] : product(left_solution(X0,X1),X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_soln) ).
fof(f4,axiom,
! [X0,X1] : product(X0,right_solution(X0,X1),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_soln) ).
fof(f5,negated_conjecture,
! [X0] : ~ product(not_identity(X0),X0,not_identity(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_right_identity) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( product(X2,X5,X4)
| ~ product(X1,X5,X3)
| ~ product(X0,X3,X4)
| ~ product(X0,X1,X2) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : product(left_solution(X0,X1),X0,X1),
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : product(X0,right_solution(X0,X1),X1),
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,negated_conjecture,
! [X0: $i] : ~ product(not_identity(X0),X0,not_identity(X0)),
inference(cnf_transformation,[],[f5]) ).
tcf(c_84,negated_conjecture,
! [X0: $i] : ~ product(not_identity(X0),X0,not_identity(X0)),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_129,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( product(X1,X4,X3)
| ~ product(X0,X4,X2)
| ~ product(left_solution(X0,X1),X2,X3) ),
inference(superposition,[status(thm)],[c_56,c_54]) ).
tcf(c_162,plain,
! [X0: $i,X1: $i,X2: $i] :
( product(X2,X1,X2)
| ~ product(X0,X1,X0) ),
inference(superposition,[status(thm)],[c_56,c_129]) ).
tcf(c_205,plain,
! [X0: $i,X1: $i] : product(X0,right_solution(X1,X1),X0),
inference(superposition,[status(thm)],[c_57,c_162]) ).
tcf(c_226,plain,
$false,
inference(superposition,[status(thm)],[c_205,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP028-4 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.43 % Computer : n017.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Wed Sep 23 13:13:48 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.27/0.52
% 0.27/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.27/0.52
% 0.27/0.52 % Detected problem language: tptp
% 0.27/0.54 % Proving...
% 2.66/1.50 % SZS status Started for theBenchmark.p
% 2.66/1.50 % SZS status Unsatisfiable for theBenchmark.p
% 2.66/1.50
% 2.66/1.50 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.66/1.50
% 2.66/1.50 % ------ iProver source info
% 2.66/1.50
% 2.66/1.50 % git: date: 2026-07-19 20:42:38 +0200
% 2.66/1.50 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.66/1.50 % git: non_committed_changes: false
% 2.66/1.50
% 2.66/1.50 % ------ Parsing...% successful
% 2.66/1.50
% 2.66/1.50
% 2.66/1.50 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.66/1.50
% 2.66/1.50 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.66/1.50
% 2.66/1.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.66/1.50 % ------ Proving...
% 2.66/1.50 % ------ Problem Properties
% 2.66/1.50
% 2.66/1.50 %
% 2.66/1.50 % clauses 5
% 2.66/1.50 % conjectures 1
% 2.66/1.50 % EPR 2
% 2.66/1.50 % Horn 5
% 2.66/1.50 % unary 3
% 2.66/1.50 % binary 0
% 2.66/1.50 % lits 11
% 2.66/1.50 % lits eq 0
% 2.66/1.50 % fd_pure 0
% 2.66/1.50 % fd_pseudo 0
% 2.66/1.50 % fd_cond 0
% 2.66/1.50 % fd_pseudo_cond 0
% 2.66/1.50 % AC symbols 0
% 2.66/1.50
% 2.66/1.50 % ------ Schedule dynamic 5 is on
% 2.66/1.50
% 2.66/1.50 % ------ no equalities: superposition off
% 2.66/1.50
% 2.66/1.50 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.66/1.50
% 2.66/1.50
% 2.66/1.50 % ------
% 2.66/1.50 % Current options:
% 2.66/1.50 % ------
% 2.66/1.50
% 2.66/1.50
% 2.66/1.50 %
% 2.66/1.50
% 2.66/1.50 % ------ Proving...
% 2.66/1.50 %
% 2.66/1.50
% 2.66/1.50 % SZS status Unsatisfiable for theBenchmark.p
% 2.66/1.50
% 2.66/1.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.66/1.50
% 2.66/1.50
%------------------------------------------------------------------------------