%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP450-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 : n016.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 2.11s 1.42s
% Output : CNFRefutation 2.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 4
% Syntax : Number of formulae : 50 ( 50 unt; 0 def)
% Number of atoms : 50 ( 49 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 109 ( 0 sgn 109 !; 0 ?; 99 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,divide(divide(divide(divide(X1,X1),X1),X2),divide(divide(divide(X1,X1),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,plain,
! [X0,X1] : divide(divide(X1,X1),X0) = inverse(X0),
inference(reorient_equations,[],[f3]) ).
fof(f5,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(divide(divide(X1,X1),X1),X2),divide(divide(divide(X1,X1),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,[],[f4]) ).
tcf(c_56,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
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(inverse(X0),X2))) = X1,
inference(demodulation,[status(thm)],[c_53,c_55]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i] : divide(inverse(divide(X0,X0)),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_55,c_55]) ).
tcf(c_116,plain,
! [X0: $i,X1: $i] : multiply(divide(X0,X0),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_68,c_55]) ).
tcf(c_125,plain,
! [X0: $i,X1: $i] : multiply(inverse(divide(X0,X0)),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_111,c_68]) ).
tcf(c_193,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(divide(inverse(X0),inverse(X1)))) = X1,
inference(superposition,[status(thm)],[c_55,c_69]) ).
tcf(c_196,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(inverse(X1),divide(inverse(X0),X1))) = divide(X2,X2),
inference(superposition,[status(thm)],[c_111,c_69]) ).
tcf(c_201,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X0),divide(divide(inverse(X1),X2),inverse(X2))) = X1,
inference(superposition,[status(thm)],[c_111,c_69]) ).
tcf(c_257,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_193,c_68]) ).
tcf(c_263,plain,
! [X0: $i,X1: $i] : inverse(inverse(multiply(inverse(divide(X0,X0)),X1))) = X1,
inference(superposition,[status(thm)],[c_257,c_116]) ).
tcf(c_267,plain,
! [X0: $i] : inverse(inverse(inverse(inverse(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_263,c_125]) ).
tcf(c_324,plain,
! [X0: $i,X1: $i] : divide(X0,X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_196,c_196]) ).
tcf(c_449,plain,
! [X0: $i,X1: $i,X2: $i] : divide(inverse(inverse(inverse(X0))),divide(divide(inverse(X1),X2),divide(X0,X2))) = X1,
inference(superposition,[status(thm)],[c_267,c_69]) ).
tcf(c_531,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_324,c_68]) ).
tcf(c_704,plain,
! [X0: $i,X1: $i] : multiply(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_531,c_257]) ).
tcf(c_777,plain,
! [X0: $i,X1: $i] : multiply(X0,inverse(X0)) = divide(X1,X1),
inference(superposition,[status(thm)],[c_704,c_257]) ).
tcf(c_894,plain,
! [X0: $i,X1: $i] : multiply(X0,divide(X1,X1)) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_777,c_257]) ).
tcf(c_918,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_894,c_704]) ).
tcf(c_980,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_918,c_257]) ).
tcf(c_985,plain,
! [X0: $i,X1: $i] : multiply(X0,inverse(X1)) = divide(X0,X1),
inference(superposition,[status(thm)],[c_918,c_68]) ).
tcf(c_1135,plain,
! [X0: $i,X1: $i] : multiply(X0,divide(inverse(X0),X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_985,c_257]) ).
tcf(c_1828,plain,
! [X0: $i,X1: $i] : inverse(multiply(divide(inverse(X0),X1),X1)) = X0,
inference(demodulation,[status(thm)],[c_201,c_55,c_68]) ).
tcf(c_1839,plain,
! [X0: $i,X1: $i] : inverse(multiply(multiply(inverse(X0),X1),inverse(X1))) = X0,
inference(superposition,[status(thm)],[c_68,c_1828]) ).
tcf(c_1937,plain,
! [X0: $i,X1: $i] : inverse(divide(multiply(inverse(X0),X1),X1)) = X0,
inference(demodulation,[status(thm)],[c_1839,c_985]) ).
tcf(c_1951,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,multiply(X1,X0))) = X1,
inference(superposition,[status(thm)],[c_980,c_1937]) ).
tcf(c_2114,plain,
! [X0: $i,X1: $i] : divide(X0,multiply(X1,X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_1951,c_918]) ).
tcf(c_2212,plain,
! [X0: $i,X1: $i] : divide(multiply(X0,X1),X1) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_980,c_2114]) ).
tcf(c_2219,plain,
! [X0: $i,X1: $i] : inverse(multiply(X0,inverse(X1))) = multiply(X1,inverse(X0)),
inference(superposition,[status(thm)],[c_2114,c_1135]) ).
tcf(c_2223,plain,
! [X0: $i,X1: $i] : divide(multiply(X0,X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_2212,c_918]) ).
tcf(c_2225,plain,
! [X0: $i,X1: $i] : multiply(X0,inverse(X1)) = inverse(divide(X1,X0)),
inference(light_normalisation,[status(thm)],[c_2219,c_985]) ).
tcf(c_2226,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,X1)) = divide(X1,X0),
inference(light_normalisation,[status(thm)],[c_2225,c_985]) ).
tcf(c_2305,plain,
! [X0: $i,X1: $i] : divide(inverse(X0),X1) = inverse(multiply(X1,X0)),
inference(superposition,[status(thm)],[c_68,c_2226]) ).
tcf(c_2327,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,X2)) = multiply(X0,divide(X2,X1)),
inference(superposition,[status(thm)],[c_2226,c_68]) ).
tcf(c_2401,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(inverse(X1),X2)) = multiply(X0,multiply(X2,X1)),
inference(superposition,[status(thm)],[c_2305,c_68]) ).
tcf(c_2647,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(X0,divide(divide(inverse(X1),X2),X3)) = multiply(X0,multiply(X3,multiply(X2,X1))),
inference(superposition,[status(thm)],[c_2401,c_2327]) ).
tcf(c_2926,plain,
! [X0: $i,X1: $i,X2: $i] : divide(inverse(X0),divide(divide(inverse(X1),X2),divide(X0,X2))) = X1,
inference(light_normalisation,[status(thm)],[c_449,c_918]) ).
tcf(c_2927,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(inverse(X0),multiply(divide(X0,X1),multiply(X1,X2))) = X2,
inference(demodulation,[status(thm)],[c_2926,c_2647]) ).
tcf(c_2957,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(divide(X0,X1),multiply(X1,X2)) = multiply(inverse(inverse(X0)),X2),
inference(superposition,[status(thm)],[c_2927,c_980]) ).
tcf(c_2966,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(divide(X0,X1),multiply(X1,X2)) = multiply(X0,X2),
inference(light_normalisation,[status(thm)],[c_2957,c_918]) ).
tcf(c_3536,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(superposition,[status(thm)],[c_2223,c_2966]) ).
tcf(c_3568,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_56,c_3536]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP450-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.16/0.43 % Computer : n016.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Wed Sep 23 14:51:56 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/0.49 Running UEQ theorem proving
% 0.16/0.50 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.26/0.51
% 0.26/0.51 % ======== iProver multi-core TPTP/SMT =========
% 0.26/0.51
% 0.26/0.51 % Detected problem language: tptp
% 0.26/0.53 % Proving...
% 2.11/1.42 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.11/1.42 % SZS status Started for theBenchmark.p
% 2.11/1.42 % SZS status Unsatisfiable for theBenchmark.p
% 2.11/1.42
% 2.11/1.42 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.11/1.42
% 2.11/1.42 % ------ iProver source info
% 2.11/1.42
% 2.11/1.42 % git: date: 2026-07-19 20:42:38 +0200
% 2.11/1.42 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.11/1.42 % git: non_committed_changes: false
% 2.11/1.42
% 2.11/1.42 % ------ Parsing...% successful
% 2.11/1.42
% 2.11/1.42
% 2.11/1.42 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.11/1.42
% 2.11/1.42 % ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.11/1.42
% 2.11/1.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.11/1.42
% 2.11/1.42 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.11/1.42 % ------ Proving...
% 2.11/1.42 % ------ Problem Properties
% 2.11/1.42
% 2.11/1.42 %
% 2.11/1.42 % clauses 4
% 2.11/1.42 % conjectures 1
% 2.11/1.42 % EPR 0
% 2.11/1.42 % Horn 4
% 2.11/1.42 % unary 4
% 2.11/1.42 % binary 0
% 2.11/1.42 % lits 4
% 2.11/1.42 % lits eq 4
% 2.11/1.42 % fd_pure 0
% 2.11/1.42 % fd_pseudo 0
% 2.11/1.42 % fd_cond 0
% 2.11/1.42 % fd_pseudo_cond 0
% 2.11/1.42 % AC symbols 0
% 2.11/1.42
% 2.11/1.42 % ------ Input Options Time Limit: Unbounded
% 2.11/1.42
% 2.11/1.42
% 2.11/1.42 % ------
% 2.11/1.42 % Current options:
% 2.11/1.42 % ------
% 2.11/1.42
% 2.11/1.42
% 2.11/1.42 %
% 2.11/1.42
% 2.11/1.42 % ------ Proving...
% 2.11/1.42 %
% 2.11/1.42
% 2.11/1.42 % SZS status Unsatisfiable for theBenchmark.p
% 2.11/1.42
% 2.11/1.42 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.11/1.42
% 2.11/1.42
%------------------------------------------------------------------------------