%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP166-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n018.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:37 PM UTC 2026
% Result : Unsatisfiable 2.27s 6.29s
% Output : CNFRefutation 2.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 22 unt; 0 def)
% Number of atoms : 22 ( 21 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 : 3 ( 1 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 : 30 ( 0 sgn 30 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
fof(f15,axiom,
! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
fof(f19,axiom,
least_upper_bound(b,identity) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lat3a_2) ).
fof(f20,plain,
b = least_upper_bound(b,identity),
inference(reorient_equations,[],[f19]) ).
fof(f21,negated_conjecture,
least_upper_bound(a,multiply(b,a)) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lat3a) ).
fof(f22,plain,
multiply(b,a) != least_upper_bound(a,multiply(b,a)),
inference(reorient_equations,[],[f21]) ).
tcf(c_67,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_72,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_73,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_80,plain,
! [X0: $i,X1: $i,X2: $i] : least_upper_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(least_upper_bound(X0,X2),X1),
inference(cnf_transformation,[],[f15]) ).
tcf(c_83,plain,
least_upper_bound(b,identity) = b,
inference(cnf_transformation,[],[f20]) ).
tcf(c_84,negated_conjecture,
least_upper_bound(a,multiply(b,a)) != multiply(b,a),
inference(cnf_transformation,[],[f22]) ).
tcf(c_100,plain,
least_upper_bound(identity,b) = b,
inference(theory_normalisation,[status(thm)],[c_83,c_72,c_70,c_73,c_71]) ).
tcf(c_1043,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,multiply(X1,X0)) = multiply(least_upper_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_67,c_80]) ).
tcf(c_1066,plain,
multiply(least_upper_bound(identity,b),a) != multiply(b,a),
inference(demodulation,[status(thm)],[c_84,c_1043]) ).
tcf(c_1067,plain,
$false,
inference(ground_joinability,[status(thm)],[c_1066,c_100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP166-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/5.37 % Computer : n018.cluster.edu
% 0.08/5.37 % Model : x86_64 x86_64
% 0.08/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.37 % Memory : 8046.5625MB
% 0.08/5.37 % OS : Linux 6.8.0-71-generic
% 0.08/5.37 % CPULimit : 300
% 0.08/5.37 % WCLimit : 300
% 0.08/5.37 % DateTime : Wed Sep 23 13:57:38 UTC 2026
% 0.08/5.38 % CPUTime :
% 0.08/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.41 Running UEQ theorem proving
% 0.14/5.41 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.14/5.42
% 0.14/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.42
% 0.14/5.43 % Detected problem language: tptp
% 0.14/5.44 % Proving...
% 2.27/6.29 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.27/6.29 % SZS status Started for theBenchmark.p
% 2.27/6.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.27/6.29
% 2.27/6.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.27/6.29
% 2.27/6.29 % ------ iProver source info
% 2.27/6.29
% 2.27/6.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.27/6.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.27/6.29 % git: non_committed_changes: false
% 2.27/6.29
% 2.27/6.29 % ------ Parsing...% successful
% 2.27/6.29
% 2.27/6.29
% 2.27/6.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.27/6.29
% 2.27/6.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.27/6.29
% 2.27/6.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.27/6.29
% 2.27/6.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.27/6.29 % ------ Proving...
% 2.27/6.29 % ------ Problem Properties
% 2.27/6.29
% 2.27/6.29 %
% 2.27/6.29 % clauses 18
% 2.27/6.29 % conjectures 1
% 2.27/6.29 % EPR 0
% 2.27/6.29 % Horn 18
% 2.27/6.29 % unary 18
% 2.27/6.29 % binary 0
% 2.27/6.29 % lits 18
% 2.27/6.29 % lits eq 18
% 2.27/6.29 % fd_pure 0
% 2.27/6.29 % fd_pseudo 0
% 2.27/6.29 % fd_cond 0
% 2.27/6.29 % fd_pseudo_cond 0
% 2.27/6.29 % AC symbols 2
% 2.27/6.29
% 2.27/6.29 % ------ Input Options Time Limit: Unbounded
% 2.27/6.29
% 2.27/6.29
% 2.27/6.29 % ------
% 2.27/6.29 % Current options:
% 2.27/6.29 % ------
% 2.27/6.29
% 2.27/6.29
% 2.27/6.29 %
% 2.27/6.29
% 2.27/6.29 % ------ Proving...
% 2.27/6.29 %
% 2.27/6.29
% 2.27/6.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.27/6.29
% 2.27/6.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.27/6.29
% 2.27/6.29
%------------------------------------------------------------------------------