%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP186-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n006.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:31:45 PM UTC 2026
% Result : Unsatisfiable 3.64s 1.38s
% Output : CNFRefutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 27 ( 27 unt; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
fof(f3,plain,
! [X0] : identity = multiply(inverse(X0),X0),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
fof(f6,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
fof(f7,axiom,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
fof(f8,axiom,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
fof(f13,axiom,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
fof(f17,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p23x) ).
tcf(c_65,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_66,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[],[f3]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
inference(cnf_transformation,[],[f8]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,least_upper_bound(X1,X2)),
inference(cnf_transformation,[],[f13]) ).
tcf(c_80,negated_conjecture,
multiply(a,least_upper_bound(inverse(a),b)) != least_upper_bound(multiply(a,b),identity),
inference(cnf_transformation,[],[f17]) ).
tcf(c_96,negated_conjecture,
multiply(a,least_upper_bound(b,inverse(a))) != least_upper_bound(identity,multiply(a,b)),
inference(theory_normalisation,[status(thm)],[c_80,c_70,c_68,c_71,c_69]) ).
tcf(c_238,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_66,c_67]) ).
tcf(c_808,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_238,c_65]) ).
tcf(c_812,plain,
! [X0: $i,X1: $i] : multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_808,c_808]) ).
tcf(c_962,plain,
! [X0: $i] : multiply(X0,inverse(X0)) = identity,
inference(superposition,[status(thm)],[c_812,c_66]) ).
tcf(c_1011,plain,
! [X0: $i,X1: $i] : multiply(X0,least_upper_bound(X1,inverse(X0))) = least_upper_bound(multiply(X0,X1),identity),
inference(superposition,[status(thm)],[c_962,c_76]) ).
tcf(c_1017,plain,
! [X0: $i,X1: $i] : multiply(X0,least_upper_bound(X1,inverse(X0))) = least_upper_bound(identity,multiply(X0,X1)),
inference(theory_normalisation,[status(thm)],[c_1011,c_71,c_69,c_70,c_68]) ).
tcf(c_1021,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_96,c_1017]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP186-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.57 % Computer : n006.cluster.edu
% 0.11/0.57 % Model : x86_64 x86_64
% 0.11/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.57 % Memory : 8046.5625MB
% 0.11/0.57 % OS : Linux 6.8.0-71-generic
% 0.11/0.57 % CPULimit : 300
% 0.11/0.57 % WCLimit : 300
% 0.11/0.57 % DateTime : Wed Sep 23 14:03:29 UTC 2026
% 0.11/0.58 % CPUTime :
% 0.11/0.58 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.61 Running UEQ theorem proving
% 0.11/0.61 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.11/0.62
% 0.11/0.62 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.62
% 0.11/0.62 % Detected problem language: tptp
% 0.15/0.63 % Proving...
% 3.64/1.38 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.64/1.38 % SZS status Started for theBenchmark.p
% 3.64/1.38 % SZS status Unsatisfiable for theBenchmark.p
% 3.64/1.38
% 3.64/1.38 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.64/1.38
% 3.64/1.38 % ------ iProver source info
% 3.64/1.38
% 3.64/1.38 % git: date: 2026-07-19 20:42:38 +0200
% 3.64/1.38 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.64/1.38 % git: non_committed_changes: false
% 3.64/1.38
% 3.64/1.38 % ------ Parsing...% successful
% 3.64/1.38
% 3.64/1.38
% 3.64/1.38 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.64/1.38
% 3.64/1.38 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.64/1.38
% 3.64/1.38 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.64/1.38
% 3.64/1.38 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.64/1.38 % ------ Proving...
% 3.64/1.38 % ------ Problem Properties
% 3.64/1.38
% 3.64/1.38 %
% 3.64/1.38 % clauses 16
% 3.64/1.38 % conjectures 1
% 3.64/1.38 % EPR 0
% 3.64/1.38 % Horn 16
% 3.64/1.38 % unary 16
% 3.64/1.38 % binary 0
% 3.64/1.38 % lits 16
% 3.64/1.38 % lits eq 16
% 3.64/1.38 % fd_pure 0
% 3.64/1.38 % fd_pseudo 0
% 3.64/1.38 % fd_cond 0
% 3.64/1.38 % fd_pseudo_cond 0
% 3.64/1.38 % AC symbols 2
% 3.64/1.38
% 3.64/1.38 % ------ Input Options Time Limit: Unbounded
% 3.64/1.38
% 3.64/1.38
% 3.64/1.38 % ------
% 3.64/1.38 % Current options:
% 3.64/1.38 % ------
% 3.64/1.38
% 3.64/1.38
% 3.64/1.38 %
% 3.64/1.38
% 3.64/1.38 % ------ Proving...
% 3.64/1.38 %
% 3.64/1.38
% 3.64/1.38 % SZS status Unsatisfiable for theBenchmark.p
% 3.64/1.38
% 3.64/1.38 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.64/1.38
% 3.64/1.38
%------------------------------------------------------------------------------