%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP178-2 : 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 : n010.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:41 PM UTC 2026
% Result : Unsatisfiable 38.50s 5.81s
% Output : CNFRefutation 38.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 38 unt; 0 def)
% Number of atoms : 38 ( 37 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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; 4 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 50 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
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(f14,axiom,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
fof(f16,axiom,
! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
fof(f21,axiom,
greatest_lower_bound(identity,c) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p09b_3) ).
fof(f22,plain,
identity = greatest_lower_bound(identity,c),
inference(reorient_equations,[],[f21]) ).
fof(f23,axiom,
greatest_lower_bound(a,b) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p09b_4) ).
fof(f24,plain,
identity = greatest_lower_bound(a,b),
inference(reorient_equations,[],[f23]) ).
fof(f25,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p09b) ).
tcf(c_69,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_70,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[],[f3]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_74,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_81,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,greatest_lower_bound(X1,X2)),
inference(cnf_transformation,[],[f14]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(greatest_lower_bound(X0,X2),X1),
inference(cnf_transformation,[],[f16]) ).
tcf(c_86,plain,
greatest_lower_bound(identity,c) = identity,
inference(cnf_transformation,[],[f22]) ).
tcf(c_87,plain,
greatest_lower_bound(a,b) = identity,
inference(cnf_transformation,[],[f24]) ).
tcf(c_88,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
inference(cnf_transformation,[],[f25]) ).
tcf(c_561,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_70,c_71]) ).
tcf(c_562,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_561,c_69]) ).
tcf(c_568,plain,
! [X0: $i] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[status(thm)],[c_70,c_562]) ).
tcf(c_570,plain,
! [X0: $i,X1: $i] : multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_562,c_562]) ).
tcf(c_642,plain,
! [X0: $i] : multiply(X0,identity) = X0,
inference(superposition,[status(thm)],[c_570,c_568]) ).
tcf(c_666,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_642,c_568]) ).
tcf(c_46766,plain,
! [X0: $i] : multiply(X0,inverse(X0)) = identity,
inference(superposition,[status(thm)],[c_666,c_70]) ).
tcf(c_46938,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(inverse(X0),X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_46766,c_71]) ).
tcf(c_46940,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_46938,c_69]) ).
tcf(c_46944,plain,
! [X0: $i] : multiply(X0,identity) = X0,
inference(superposition,[status(thm)],[c_70,c_46940]) ).
tcf(c_48124,plain,
! [X0: $i] : greatest_lower_bound(multiply(X0,identity),multiply(X0,c)) = multiply(X0,identity),
inference(superposition,[status(thm)],[c_86,c_81]) ).
tcf(c_48163,plain,
! [X0: $i] : greatest_lower_bound(X0,multiply(X0,c)) = X0,
inference(demodulation,[status(thm)],[c_48124,c_46944]) ).
tcf(c_48233,plain,
! [X0: $i] : greatest_lower_bound(multiply(a,X0),multiply(b,X0)) = multiply(identity,X0),
inference(superposition,[status(thm)],[c_87,c_83]) ).
tcf(c_48272,plain,
! [X0: $i] : greatest_lower_bound(multiply(a,X0),multiply(b,X0)) = X0,
inference(demodulation,[status(thm)],[c_48233,c_69]) ).
tcf(c_48303,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,greatest_lower_bound(multiply(X0,c),X1)) = greatest_lower_bound(X0,X1),
inference(superposition,[status(thm)],[c_48163,c_74]) ).
tcf(c_143520,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c),
inference(superposition,[status(thm)],[c_48272,c_48303]) ).
tcf(c_143725,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_143520,c_88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP178-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n010.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Wed Sep 23 14:00:43 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running UEQ theorem proving
% 0.10/0.42 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.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 38.50/5.81 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 38.50/5.81 % SZS status Started for theBenchmark.p
% 38.50/5.81 % SZS status Unsatisfiable for theBenchmark.p
% 38.50/5.81
% 38.50/5.81 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 38.50/5.81
% 38.50/5.81 % ------ iProver source info
% 38.50/5.81
% 38.50/5.81 % git: date: 2026-07-19 20:42:38 +0200
% 38.50/5.81 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 38.50/5.81 % git: non_committed_changes: false
% 38.50/5.81
% 38.50/5.81 % ------ Parsing...% successful
% 38.50/5.81
% 38.50/5.81
% 38.50/5.81 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 38.50/5.81
% 38.50/5.81 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 38.50/5.81
% 38.50/5.81 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 38.50/5.81
% 38.50/5.81 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 38.50/5.81 % ------ Proving...
% 38.50/5.81 % ------ Problem Properties
% 38.50/5.81
% 38.50/5.81 %
% 38.50/5.81 % clauses 20
% 38.50/5.81 % conjectures 1
% 38.50/5.81 % EPR 0
% 38.50/5.81 % Horn 20
% 38.50/5.81 % unary 20
% 38.50/5.81 % binary 0
% 38.50/5.81 % lits 20
% 38.50/5.81 % lits eq 20
% 38.50/5.81 % fd_pure 0
% 38.50/5.81 % fd_pseudo 0
% 38.50/5.81 % fd_cond 0
% 38.50/5.81 % fd_pseudo_cond 0
% 38.50/5.81 % AC symbols 2
% 38.50/5.81
% 38.50/5.81 % ------ Input Options Time Limit: Unbounded
% 38.50/5.81
% 38.50/5.81
% 38.50/5.81 % ------
% 38.50/5.81 % Current options:
% 38.50/5.81 % ------
% 38.50/5.81
% 38.50/5.81
% 38.50/5.81 %
% 38.50/5.81
% 38.50/5.81 % ------ Proving...
% 38.50/5.81 %
% 38.50/5.81
% 38.50/5.81 % SZS status Unsatisfiable for theBenchmark.p
% 38.50/5.81
% 38.50/5.81 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 38.50/5.82
% 38.50/5.82
%------------------------------------------------------------------------------