%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP007-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n009.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:53 PM UTC 2026
% Result : Unsatisfiable 1.64s 1.17s
% Output : CNFRefutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 11 unt; 0 def)
% Number of atoms : 13 ( 6 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn 6 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : product(identity,X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_identity) ).
fof(f10,axiom,
! [X0] : product(X0,c,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',another_right_identity) ).
fof(f11,negated_conjecture,
identity != c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_identity_equals_c) ).
tcf(c_60,plain,
! [X0: $i] : product(identity,X0,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_69,plain,
! [X0: $i] : product(X0,c,X0),
inference(cnf_transformation,[],[f10]) ).
tcf(c_70,negated_conjecture,
c != identity,
inference(cnf_transformation,[],[f11]) ).
tcf(c_79,plain,
! [X0: $i] : multiply(X0,c) = X0,
inference(well_definedness,[status(thm)],[c_69]) ).
tcf(c_80,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(well_definedness,[status(thm)],[c_60]) ).
tcf(c_162,negated_conjecture,
c != identity,
inference(demodulation,[status(thm)],[c_70]) ).
tcf(c_197,plain,
c = identity,
inference(superposition,[status(thm)],[c_79,c_80]) ).
tcf(c_199,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_197,c_162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP007-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.37 % Computer : n009.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Wed Sep 23 13:12:28 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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.08/0.41
% 0.08/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.41
% 0.08/0.41 % Detected problem language: tptp
% 0.08/0.42 % Proving...
% 1.64/1.17 % SZS status Started for theBenchmark.p
% 1.64/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 1.64/1.17
% 1.64/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.64/1.17
% 1.64/1.17 % ------ iProver source info
% 1.64/1.17
% 1.64/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 1.64/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.64/1.17 % git: non_committed_changes: false
% 1.64/1.17
% 1.64/1.17 % ------ Parsing...% successful
% 1.64/1.17
% 1.64/1.17
% 1.64/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.64/1.17
% 1.64/1.17 % ------ Preprocessing... sup_sim: 4 sf_s rm: 0 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.64/1.17
% 1.64/1.17 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 1.64/1.17 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.64/1.17
% 1.64/1.17 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.64/1.17 % ------ Proving...
% 1.64/1.17 % ------ Problem Properties
% 1.64/1.17
% 1.64/1.17 %
% 1.64/1.17 % clauses 8
% 1.64/1.17 % conjectures 1
% 1.64/1.17 % EPR 1
% 1.64/1.17 % Horn 8
% 1.64/1.17 % unary 8
% 1.64/1.17 % binary 0
% 1.64/1.17 % lits 8
% 1.64/1.17 % lits eq 8
% 1.64/1.17 % fd_pure 0
% 1.64/1.17 % fd_pseudo 0
% 1.64/1.17 % fd_cond 0
% 1.64/1.17 % fd_pseudo_cond 0
% 1.64/1.17 % AC symbols 0
% 1.64/1.17
% 1.64/1.17 % ------ Schedule UEQ
% 1.64/1.17
% 1.64/1.17 % ------ Option_UEQ Time Limit: 10.
% 1.64/1.17
% 1.64/1.17
% 1.64/1.17 % ------
% 1.64/1.17 % Current options:
% 1.64/1.17 % ------
% 1.64/1.17
% 1.64/1.17
% 1.64/1.17 %
% 1.64/1.17
% 1.64/1.17 % ------ Proving...
% 1.64/1.17 %
% 1.64/1.17
% 1.64/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 1.64/1.17
% 1.64/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.64/1.17
% 1.64/1.17
%------------------------------------------------------------------------------