%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP446-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n013.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:34:17 PM UTC 2026
% Result : Unsatisfiable 0.92s 1.22s
% Output : CNFRefutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 31 unt; 0 def)
% Number of atoms : 31 ( 30 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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; 2 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 57 !; 0 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,divide(divide(divide(divide(X0,X0),X1),X2),divide(divide(divide(X0,X0),X0),X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
fof(f4,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f5,plain,
a2 != multiply(multiply(inverse(b2),b2),a2),
inference(reorient_equations,[],[f4]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(divide(divide(X0,X0),X1),X2),divide(divide(divide(X0,X0),X0),X2))) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(X1,X1),X2)) = multiply(X0,X2),
inference(cnf_transformation,[],[f2]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),X1) = inverse(X1),
inference(cnf_transformation,[],[f3]) ).
tcf(c_56,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(cnf_transformation,[],[f5]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_54,c_55]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(inverse(X1),X2),divide(divide(divide(X0,X0),X0),X2))) = X1,
inference(light_normalisation,[status(thm)],[c_53,c_55]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(inverse(X1),X2),divide(inverse(X0),X2))) = X1,
inference(demodulation,[status(thm)],[c_69,c_55]) ).
tcf(c_119,plain,
! [X0: $i,X1: $i] : divide(inverse(divide(X0,X0)),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_55,c_55]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i] : divide(multiply(inverse(X0),X0),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_68,c_55]) ).
tcf(c_124,plain,
! [X0: $i,X1: $i] : multiply(divide(X0,X0),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_68,c_55]) ).
tcf(c_133,plain,
! [X0: $i,X1: $i] : multiply(inverse(divide(X0,X0)),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_119,c_68]) ).
tcf(c_141,plain,
! [X0: $i,X1: $i] : multiply(multiply(inverse(X0),X0),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_123,c_68]) ).
tcf(c_142,plain,
inverse(inverse(a2)) != a2,
inference(demodulation,[status(thm)],[c_56,c_141]) ).
tcf(c_163,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(divide(inverse(X0),inverse(X1)))) = X1,
inference(superposition,[status(thm)],[c_55,c_70]) ).
tcf(c_170,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X0),divide(divide(inverse(X1),X2),inverse(X2))) = X1,
inference(superposition,[status(thm)],[c_119,c_70]) ).
tcf(c_261,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_163,c_68]) ).
tcf(c_267,plain,
! [X0: $i,X1: $i] : inverse(inverse(multiply(inverse(divide(X0,X0)),X1))) = X1,
inference(superposition,[status(thm)],[c_261,c_124]) ).
tcf(c_270,plain,
! [X0: $i,X1: $i] : multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_261,c_261]) ).
tcf(c_271,plain,
! [X0: $i] : inverse(inverse(inverse(inverse(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_267,c_133]) ).
tcf(c_302,plain,
! [X0: $i,X1: $i] : multiply(X0,inverse(inverse(inverse(X1)))) = divide(X0,X1),
inference(superposition,[status(thm)],[c_271,c_68]) ).
tcf(c_401,plain,
! [X0: $i,X1: $i] : multiply(X0,inverse(inverse(inverse(X1)))) = divide(inverse(inverse(X0)),X1),
inference(superposition,[status(thm)],[c_302,c_270]) ).
tcf(c_403,plain,
! [X0: $i,X1: $i] : divide(inverse(inverse(X0)),X1) = divide(X0,X1),
inference(light_normalisation,[status(thm)],[c_401,c_302]) ).
tcf(c_678,plain,
! [X0: $i,X1: $i] : inverse(multiply(divide(inverse(X0),X1),X1)) = X0,
inference(demodulation,[status(thm)],[c_170,c_55,c_68]) ).
tcf(c_687,plain,
! [X0: $i,X1: $i] : inverse(multiply(divide(X0,X1),X1)) = inverse(X0),
inference(superposition,[status(thm)],[c_403,c_678]) ).
tcf(c_706,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_678,c_687]) ).
tcf(c_707,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_142,c_706]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP446-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.41 % Computer : n013.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Wed Sep 23 14:46:21 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.41 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.45 Running UEQ theorem proving
% 0.14/0.45 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.20/0.46
% 0.20/0.46 % ======== iProver multi-core TPTP/SMT =========
% 0.20/0.46
% 0.20/0.46 % Detected problem language: tptp
% 0.20/0.47 % Proving...
% 0.92/1.22 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 0.92/1.22 % SZS status Started for theBenchmark.p
% 0.92/1.22 % SZS status Unsatisfiable for theBenchmark.p
% 0.92/1.22
% 0.92/1.22 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.92/1.22
% 0.92/1.22 % ------ iProver source info
% 0.92/1.22
% 0.92/1.22 % git: date: 2026-07-19 20:42:38 +0200
% 0.92/1.22 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.92/1.22 % git: non_committed_changes: false
% 0.92/1.22
% 0.92/1.22 % ------ Parsing...% successful
% 0.92/1.22
% 0.92/1.22
% 0.92/1.22 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.92/1.22
% 0.92/1.22 % ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.92/1.22
% 0.92/1.22 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.92/1.22
% 0.92/1.22 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.92/1.22 % ------ Proving...
% 0.92/1.22 % ------ Problem Properties
% 0.92/1.22
% 0.92/1.22 %
% 0.92/1.22 % clauses 4
% 0.92/1.22 % conjectures 1
% 0.92/1.22 % EPR 0
% 0.92/1.22 % Horn 4
% 0.92/1.22 % unary 4
% 0.92/1.22 % binary 0
% 0.92/1.22 % lits 4
% 0.92/1.22 % lits eq 4
% 0.92/1.22 % fd_pure 0
% 0.92/1.22 % fd_pseudo 0
% 0.92/1.22 % fd_cond 0
% 0.92/1.22 % fd_pseudo_cond 0
% 0.92/1.22 % AC symbols 0
% 0.92/1.22
% 0.92/1.22 % ------ Input Options Time Limit: Unbounded
% 0.92/1.22
% 0.92/1.22
% 0.92/1.22 % ------
% 0.92/1.22 % Current options:
% 0.92/1.22 % ------
% 0.92/1.22
% 0.92/1.22
% 0.92/1.22 %
% 0.92/1.22
% 0.92/1.22 % ------ Proving...
% 0.92/1.22 %
% 0.92/1.22
% 0.92/1.22 % SZS status Unsatisfiable for theBenchmark.p
% 0.92/1.22
% 0.92/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.92/1.22
% 0.92/1.22
%------------------------------------------------------------------------------