%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP156-1 : 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 : 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:35 PM UTC 2026
% Result : Unsatisfiable 1.44s 1.28s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% 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 : 5 ( 5 ~; 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 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
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(f12,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
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/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
fof(f17,axiom,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_mono1c_1) ).
fof(f18,plain,
b = least_upper_bound(a,b),
inference(reorient_equations,[],[f17]) ).
fof(f19,negated_conjecture,
greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_mono1c) ).
fof(f20,plain,
multiply(a,c) != greatest_lower_bound(multiply(a,c),multiply(b,c)),
inference(reorient_equations,[],[f19]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_71,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_72,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] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[],[f12]) ).
tcf(c_80,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_81,plain,
least_upper_bound(a,b) = b,
inference(cnf_transformation,[],[f18]) ).
tcf(c_82,negated_conjecture,
greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
inference(cnf_transformation,[],[f20]) ).
tcf(c_132,plain,
multiply(greatest_lower_bound(a,b),c) != multiply(a,c),
inference(ac_demodulation,[status(thm)],[c_82,c_80,c_72,c_70,c_71,c_69]) ).
tcf(c_229,plain,
greatest_lower_bound(a,b) = a,
inference(superposition,[status(thm)],[c_81,c_76]) ).
tcf(c_237,plain,
multiply(a,c) != multiply(a,c),
inference(demodulation,[status(thm)],[c_132,c_229]) ).
tcf(c_238,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_237]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP156-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.37 % Computer : n010.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Wed Sep 23 13:53:32 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.41 Running UEQ theorem proving
% 0.08/0.41 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.08/0.42
% 0.08/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.42
% 0.08/0.42 % Detected problem language: tptp
% 0.08/0.43 % Proving...
% 1.44/1.28 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.44/1.28 % SZS status Started for theBenchmark.p
% 1.44/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.44/1.28
% 1.44/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.44/1.28
% 1.44/1.28 % ------ iProver source info
% 1.44/1.28
% 1.44/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.44/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.44/1.28 % git: non_committed_changes: false
% 1.44/1.28
% 1.44/1.28 % ------ Parsing...% successful
% 1.44/1.28
% 1.44/1.28
% 1.44/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.44/1.28
% 1.44/1.28 % ------ Preprocessing... sup_sim: 3 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.44/1.28
% 1.44/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.44/1.28
% 1.44/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.44/1.28 % ------ Proving...
% 1.44/1.28 % ------ Problem Properties
% 1.44/1.28
% 1.44/1.28 %
% 1.44/1.28 % clauses 17
% 1.44/1.28 % conjectures 0
% 1.44/1.28 % EPR 0
% 1.44/1.28 % Horn 17
% 1.44/1.28 % unary 17
% 1.44/1.28 % binary 0
% 1.44/1.28 % lits 17
% 1.44/1.28 % lits eq 17
% 1.44/1.28 % fd_pure 0
% 1.44/1.28 % fd_pseudo 0
% 1.44/1.28 % fd_cond 0
% 1.44/1.28 % fd_pseudo_cond 0
% 1.44/1.28 % AC symbols 2
% 1.44/1.28
% 1.44/1.28 % ------ Input Options Time Limit: Unbounded
% 1.44/1.28
% 1.44/1.28
% 1.44/1.28 % ------
% 1.44/1.28 % Current options:
% 1.44/1.28 % ------
% 1.44/1.28
% 1.44/1.28
% 1.44/1.28 %
% 1.44/1.28
% 1.44/1.28 % ------ Proving...
% 1.44/1.28 %
% 1.44/1.28
% 1.44/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.44/1.28
% 1.44/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.44/1.28
% 1.44/1.28
%------------------------------------------------------------------------------