%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP115-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n004.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:30:56 PM UTC 2026
% Result : Unsatisfiable 1.85s 1.18s
% Output : CNFRefutation 1.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 17 unt; 0 def)
% Number of atoms : 17 ( 16 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 : 8 ( 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : multiply(X0,multiply(multiply(X0,multiply(multiply(X0,X1),X2)),multiply(identity,multiply(X2,X2)))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,negated_conjecture,
multiply(a,multiply(a,a)) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_order3) ).
fof(f3,plain,
identity != multiply(a,multiply(a,a)),
inference(reorient_equations,[],[f2]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(multiply(X0,multiply(multiply(X0,X1),X2)),multiply(identity,multiply(X2,X2)))) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_52,negated_conjecture,
multiply(a,multiply(a,a)) != identity,
inference(cnf_transformation,[],[f3]) ).
tcf(c_91,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(multiply(X0,multiply(multiply(X0,X1),multiply(identity,multiply(multiply(identity,X2),multiply(identity,X2))))),X2)) = X1,
inference(superposition,[status(thm)],[c_51,c_51]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),multiply(identity,X2)) = multiply(X0,multiply(X1,X2)),
inference(superposition,[status(thm)],[c_51,c_91]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(multiply(X0,multiply(X0,multiply(X1,multiply(multiply(identity,X2),multiply(identity,X2))))),X2)) = X1,
inference(demodulation,[status(thm)],[c_91,c_96]) ).
tcf(c_112,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(X0,multiply(multiply(multiply(X0,X1),X2),multiply(X2,X2)))) = X1,
inference(demodulation,[status(thm)],[c_51,c_96]) ).
tcf(c_154,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(X0,multiply(multiply(X0,X1),multiply(identity,identity)))) = X1,
inference(superposition,[status(thm)],[c_96,c_112]) ).
tcf(c_200,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(X0,multiply(X0,multiply(X1,identity)))) = X1,
inference(demodulation,[status(thm)],[c_154,c_96]) ).
tcf(c_371,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(multiply(X0,multiply(X0,multiply(X1,multiply(identity,multiply(X2,X2))))),X2)) = X1,
inference(demodulation,[status(thm)],[c_111,c_96]) ).
tcf(c_377,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(X0,multiply(multiply(X0,multiply(X0,multiply(X1,multiply(X2,multiply(X3,X3))))),X3)) = multiply(X1,X2),
inference(superposition,[status(thm)],[c_96,c_371]) ).
tcf(c_386,plain,
! [X0: $i] : multiply(X0,identity) = X0,
inference(demodulation,[status(thm)],[c_371,c_377]) ).
tcf(c_388,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(X0,multiply(X0,X1))) = X1,
inference(demodulation,[status(thm)],[c_200,c_386]) ).
tcf(c_510,plain,
! [X0: $i] : multiply(X0,multiply(X0,X0)) = identity,
inference(superposition,[status(thm)],[c_386,c_388]) ).
tcf(c_517,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_510]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP115-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 13:33:52 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.40 Running UEQ theorem proving
% 0.12/0.40 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.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.85/1.18 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.85/1.18 % SZS status Started for theBenchmark.p
% 1.85/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.85/1.18
% 1.85/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.85/1.18
% 1.85/1.18 % ------ iProver source info
% 1.85/1.18
% 1.85/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 1.85/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.85/1.18 % git: non_committed_changes: false
% 1.85/1.18
% 1.85/1.18 % ------ Parsing...% successful
% 1.85/1.18
% 1.85/1.18
% 1.85/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.85/1.18
% 1.85/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.85/1.18
% 1.85/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.85/1.18
% 1.85/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.85/1.18 % ------ Proving...
% 1.85/1.18 % ------ Problem Properties
% 1.85/1.18
% 1.85/1.18 %
% 1.85/1.18 % clauses 2
% 1.85/1.18 % conjectures 1
% 1.85/1.18 % EPR 0
% 1.85/1.18 % Horn 2
% 1.85/1.18 % unary 2
% 1.85/1.18 % binary 0
% 1.85/1.18 % lits 2
% 1.85/1.18 % lits eq 2
% 1.85/1.18 % fd_pure 0
% 1.85/1.18 % fd_pseudo 0
% 1.85/1.18 % fd_cond 0
% 1.85/1.18 % fd_pseudo_cond 0
% 1.85/1.18 % AC symbols 0
% 1.85/1.18
% 1.85/1.18 % ------ Input Options Time Limit: Unbounded
% 1.85/1.18
% 1.85/1.18
% 1.85/1.18 % ------
% 1.85/1.18 % Current options:
% 1.85/1.18 % ------
% 1.85/1.18
% 1.85/1.18
% 1.85/1.18 %
% 1.85/1.18
% 1.85/1.18 % ------ Proving...
% 1.85/1.18 %
% 1.85/1.18
% 1.85/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.85/1.18
% 1.85/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.85/1.18
% 1.85/1.18
%------------------------------------------------------------------------------