%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP536-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n026.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:40 PM UTC 2026
% Result : Unsatisfiable 1.67s 1.17s
% Output : CNFRefutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 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 : 45 ( 0 sgn 45 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(divide(X0,divide(divide(X0,X1),X2)),X1) = X2,
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,axiom,
! [X0] : identity = divide(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
fof(f5,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,divide(divide(X0,X1),X2)),X1) = X2,
inference(cnf_transformation,[],[f1]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(X1,X1),X2)) = multiply(X0,X2),
inference(cnf_transformation,[],[f2]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),X1) = inverse(X1),
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,plain,
! [X0: $i] : divide(X0,X0) = identity,
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,negated_conjecture,
multiply(a,b) != multiply(b,a),
inference(cnf_transformation,[],[f5]) ).
tcf(c_73,plain,
! [X0: $i] : divide(identity,X0) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_56,c_57]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_55,c_57,c_73]) ).
tcf(c_123,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(superposition,[status(thm)],[c_74,c_57]) ).
tcf(c_124,plain,
! [X0: $i] : multiply(identity,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_74,c_73]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i] : divide(divide(X0,divide(identity,X1)),X0) = X1,
inference(superposition,[status(thm)],[c_57,c_54]) ).
tcf(c_245,plain,
! [X0: $i,X1: $i] : divide(multiply(X0,X1),X0) = X1,
inference(demodulation,[status(thm)],[c_146,c_73,c_74]) ).
tcf(c_247,plain,
! [X0: $i] : divide(identity,inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_123,c_245]) ).
tcf(c_280,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(demodulation,[status(thm)],[c_247,c_73,c_124]) ).
tcf(c_283,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_124,c_280]) ).
tcf(c_287,plain,
! [X0: $i] : divide(X0,identity) = X0,
inference(superposition,[status(thm)],[c_280,c_245]) ).
tcf(c_295,plain,
! [X0: $i,X1: $i] : multiply(X0,inverse(X1)) = divide(X0,X1),
inference(superposition,[status(thm)],[c_283,c_74]) ).
tcf(c_302,plain,
! [X0: $i,X1: $i] : divide(X0,divide(divide(X0,identity),X1)) = X1,
inference(superposition,[status(thm)],[c_287,c_54]) ).
tcf(c_305,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X0,X1)) = X1,
inference(light_normalisation,[status(thm)],[c_302,c_287]) ).
tcf(c_375,plain,
! [X0: $i,X1: $i] : divide(multiply(X0,X1),X1) = X0,
inference(superposition,[status(thm)],[c_245,c_305]) ).
tcf(c_404,plain,
! [X0: $i,X1: $i] : multiply(multiply(X0,inverse(X1)),X1) = X0,
inference(superposition,[status(thm)],[c_375,c_74]) ).
tcf(c_406,plain,
! [X0: $i,X1: $i] : multiply(divide(X0,X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_404,c_295]) ).
tcf(c_433,plain,
! [X0: $i,X1: $i] : multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_245,c_406]) ).
tcf(c_438,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_58,c_433]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP536-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 15:03:23 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running UEQ theorem proving
% 0.10/0.40 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.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.67/1.17 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.67/1.17 % SZS status Started for theBenchmark.p
% 1.67/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 1.67/1.17
% 1.67/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.67/1.17
% 1.67/1.17 % ------ iProver source info
% 1.67/1.17
% 1.67/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 1.67/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.67/1.17 % git: non_committed_changes: false
% 1.67/1.17
% 1.67/1.17 % ------ Parsing...% successful
% 1.67/1.17
% 1.67/1.17
% 1.67/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.67/1.17
% 1.67/1.17 % ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.67/1.17
% 1.67/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.67/1.17
% 1.67/1.17 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.67/1.17 % ------ Proving...
% 1.67/1.17 % ------ Problem Properties
% 1.67/1.17
% 1.67/1.17 %
% 1.67/1.17 % clauses 5
% 1.67/1.17 % conjectures 1
% 1.67/1.17 % EPR 0
% 1.67/1.17 % Horn 5
% 1.67/1.17 % unary 5
% 1.67/1.17 % binary 0
% 1.67/1.17 % lits 5
% 1.67/1.17 % lits eq 5
% 1.67/1.17 % fd_pure 0
% 1.67/1.17 % fd_pseudo 0
% 1.67/1.17 % fd_cond 0
% 1.67/1.17 % fd_pseudo_cond 0
% 1.67/1.17 % AC symbols 0
% 1.67/1.17
% 1.67/1.17 % ------ Input Options Time Limit: Unbounded
% 1.67/1.17
% 1.67/1.17
% 1.67/1.17 % ------
% 1.67/1.17 % Current options:
% 1.67/1.17 % ------
% 1.67/1.17
% 1.67/1.17
% 1.67/1.17 %
% 1.67/1.17
% 1.67/1.17 % ------ Proving...
% 1.67/1.17 %
% 1.67/1.17
% 1.67/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 1.67/1.17
% 1.67/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.67/1.17
% 1.67/1.17
%------------------------------------------------------------------------------