%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP531-1 : 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 : n005.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:39 PM UTC 2026
% Result : Unsatisfiable 1.73s 1.18s
% Output : CNFRefutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 41 ( 41 unt; 0 def)
% Number of atoms : 41 ( 40 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 : 4 ( 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 : 86 ( 0 sgn 86 !; 0 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(divide(X0,divide(X1,X2)),divide(X0,X1)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
fof(f4,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,divide(X1,X2)),divide(X0,X1)) = X2,
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(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(cnf_transformation,[],[f4]) ).
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_210,plain,
! [X0: $i,X1: $i] : inverse(divide(divide(X0,X1),X0)) = X1,
inference(superposition,[status(thm)],[c_53,c_55]) ).
tcf(c_286,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_55,c_210]) ).
tcf(c_332,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X1),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_210,c_286]) ).
tcf(c_335,plain,
! [X0: $i,X1: $i] : multiply(X0,inverse(X1)) = divide(X0,X1),
inference(superposition,[status(thm)],[c_286,c_68]) ).
tcf(c_385,plain,
! [X0: $i,X1: $i] : divide(inverse(X0),divide(X1,X1)) = inverse(X0),
inference(superposition,[status(thm)],[c_55,c_332]) ).
tcf(c_386,plain,
! [X0: $i,X1: $i] : divide(multiply(X0,X1),X0) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_68,c_332]) ).
tcf(c_477,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_286,c_385]) ).
tcf(c_490,plain,
! [X0: $i,X1: $i] : divide(multiply(X0,X1),X0) = X1,
inference(demodulation,[status(thm)],[c_386,c_286]) ).
tcf(c_500,plain,
! [X0: $i,X1: $i] : divide(X0,multiply(X1,X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_490,c_332]) ).
tcf(c_502,plain,
! [X0: $i,X1: $i] : multiply(multiply(inverse(X0),X1),X0) = X1,
inference(superposition,[status(thm)],[c_490,c_68]) ).
tcf(c_597,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_477,c_53]) ).
tcf(c_704,plain,
! [X0: $i,X1: $i] : divide(multiply(X0,X1),X1) = X0,
inference(superposition,[status(thm)],[c_490,c_597]) ).
tcf(c_706,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(X0,X2)) = divide(X2,X1),
inference(superposition,[status(thm)],[c_597,c_53]) ).
tcf(c_708,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_597,c_332]) ).
tcf(c_812,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),X1) = divide(X1,X0),
inference(superposition,[status(thm)],[c_502,c_704]) ).
tcf(c_816,plain,
! [X0: $i,X1: $i] : multiply(multiply(X0,inverse(X1)),X1) = X0,
inference(superposition,[status(thm)],[c_704,c_68]) ).
tcf(c_818,plain,
! [X0: $i,X1: $i] : multiply(divide(X0,X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_816,c_335]) ).
tcf(c_832,plain,
! [X0: $i,X1: $i] : multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_490,c_818]) ).
tcf(c_840,plain,
multiply(a3,multiply(b3,c3)) != multiply(c3,multiply(a3,b3)),
inference(demodulation,[status(thm)],[c_56,c_832]) ).
tcf(c_882,plain,
! [X0: $i,X1: $i] : divide(inverse(X0),X1) = inverse(multiply(X0,X1)),
inference(superposition,[status(thm)],[c_500,c_332]) ).
tcf(c_914,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,X2)) = multiply(X0,divide(X2,X1)),
inference(superposition,[status(thm)],[c_708,c_335]) ).
tcf(c_924,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,X2)) = multiply(divide(X2,X1),X0),
inference(superposition,[status(thm)],[c_708,c_812]) ).
tcf(c_1113,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(inverse(X1),X2)) = multiply(X0,multiply(X1,X2)),
inference(superposition,[status(thm)],[c_882,c_68]) ).
tcf(c_1191,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,X2)) = divide(X2,divide(X1,X0)),
inference(superposition,[status(thm)],[c_597,c_706]) ).
tcf(c_1268,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(inverse(X1),X2)) = multiply(X0,multiply(X2,X1)),
inference(superposition,[status(thm)],[c_68,c_914]) ).
tcf(c_1301,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(inverse(X1),X2)) = multiply(multiply(X2,X1),X0),
inference(superposition,[status(thm)],[c_68,c_924]) ).
tcf(c_1980,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(X1,X2)) = multiply(X0,multiply(X2,X1)),
inference(superposition,[status(thm)],[c_1268,c_1113]) ).
tcf(c_1991,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(inverse(X1),X2)) = multiply(X2,multiply(X0,X1)),
inference(superposition,[status(thm)],[c_1268,c_1191]) ).
tcf(c_2072,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X2,X1)),
inference(light_normalisation,[status(thm)],[c_1301,c_1991]) ).
tcf(c_2090,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X0,X2)),
inference(superposition,[status(thm)],[c_2072,c_832]) ).
tcf(c_2098,plain,
multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(c3,b3)),
inference(demodulation,[status(thm)],[c_840,c_2090]) ).
tcf(c_2099,plain,
$false,
inference(ground_joinability,[status(thm)],[c_2098,c_1980]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP531-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n005.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 15:00:02 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running UEQ theorem proving
% 0.10/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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 1.73/1.18 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.73/1.18 % SZS status Started for theBenchmark.p
% 1.73/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.73/1.18
% 1.73/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.73/1.18
% 1.73/1.18 % ------ iProver source info
% 1.73/1.18
% 1.73/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 1.73/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.73/1.18 % git: non_committed_changes: false
% 1.73/1.18
% 1.73/1.18 % ------ Parsing...% successful
% 1.73/1.18
% 1.73/1.18
% 1.73/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.73/1.18
% 1.73/1.18 % ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.73/1.18
% 1.73/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.73/1.18
% 1.73/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.73/1.18 % ------ Proving...
% 1.73/1.18 % ------ Problem Properties
% 1.73/1.18
% 1.73/1.18 %
% 1.73/1.18 % clauses 4
% 1.73/1.18 % conjectures 1
% 1.73/1.18 % EPR 0
% 1.73/1.18 % Horn 4
% 1.73/1.18 % unary 4
% 1.73/1.18 % binary 0
% 1.73/1.18 % lits 4
% 1.73/1.18 % lits eq 4
% 1.73/1.18 % fd_pure 0
% 1.73/1.18 % fd_pseudo 0
% 1.73/1.18 % fd_cond 0
% 1.73/1.18 % fd_pseudo_cond 0
% 1.73/1.18 % AC symbols 0
% 1.73/1.18
% 1.73/1.18 % ------ Input Options Time Limit: Unbounded
% 1.73/1.18
% 1.73/1.18
% 1.73/1.18 % ------
% 1.73/1.18 % Current options:
% 1.73/1.18 % ------
% 1.73/1.18
% 1.73/1.18
% 1.73/1.18 %
% 1.73/1.18
% 1.73/1.18 % ------ Proving...
% 1.73/1.18 %
% 1.73/1.18
% 1.73/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.73/1.18
% 1.73/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.73/1.18
% 1.73/1.18
%------------------------------------------------------------------------------