%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : GRP170-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n012.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 : Sun Sep 27 07:20:18 AM UTC 2026
% Result : Unsatisfiable 2.04s 1.30s
% Output : Refutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 18
% Syntax : Number of formulae : 37 ( 37 unt; 0 typ; 0 def)
% Number of atoms : 37 ( 36 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 204 ( 2 ~; 0 |; 0 &; 202 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 66 ( 0 ^; 66 !; 0 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
thf(least_upper_bound_decl,type,
least_upper_bound: $i > $i > $i ).
thf(multiply_decl,type,
multiply: $i > $i > $i ).
thf(a_decl,type,
a: $i ).
thf(c_decl,type,
c: $i ).
thf(b_decl,type,
b: $i ).
thf(d_decl,type,
d: $i ).
thf(greatest_lower_bound_decl,type,
greatest_lower_bound: $i > $i > $i ).
thf(inverse_decl,type,
inverse: $i > $i ).
thf(identity_decl,type,
identity: $i ).
thf(17,axiom,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ least_upper_bound ) @ ( A @ multiply ) )
= ( C @ ( A @ multiply ) @ ( B @ ( A @ multiply ) @ least_upper_bound ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).
thf(52,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ least_upper_bound ) @ ( A @ multiply ) )
= ( C @ ( A @ multiply ) @ ( B @ ( A @ multiply ) @ least_upper_bound ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).
thf(14,axiom,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ least_upper_bound ) @ ( A @ least_upper_bound ) )
= ( C @ ( B @ ( A @ least_upper_bound ) @ least_upper_bound ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_lub) ).
thf(46,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ least_upper_bound ) @ ( A @ least_upper_bound ) )
= ( C @ ( B @ ( A @ least_upper_bound ) @ least_upper_bound ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(18,axiom,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ ( A @ least_upper_bound ) @ multiply ) )
= ( C @ ( B @ multiply ) @ ( C @ ( A @ multiply ) @ least_upper_bound ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub2) ).
thf(54,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ ( A @ least_upper_bound ) @ multiply ) )
= ( C @ ( B @ multiply ) @ ( C @ ( A @ multiply ) @ least_upper_bound ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).
thf(15,axiom,
! [A: $i] :
( ( A @ ( identity @ multiply ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
thf(48,plain,
! [A: $i] :
( ( A @ ( identity @ multiply ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(16,axiom,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ ( A @ multiply ) @ multiply ) )
= ( C @ ( B @ multiply ) @ ( A @ multiply ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).
thf(50,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ ( A @ multiply ) @ multiply ) )
= ( C @ ( B @ multiply ) @ ( A @ multiply ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(12,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ greatest_lower_bound ) @ ( A @ least_upper_bound ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).
thf(42,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ greatest_lower_bound ) @ ( A @ least_upper_bound ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(3,axiom,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ greatest_lower_bound ) @ ( A @ greatest_lower_bound ) )
= ( C @ ( B @ ( A @ greatest_lower_bound ) @ greatest_lower_bound ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_glb) ).
thf(24,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ greatest_lower_bound ) @ ( A @ greatest_lower_bound ) )
= ( C @ ( B @ ( A @ greatest_lower_bound ) @ greatest_lower_bound ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(5,axiom,
! [A: $i] :
( ( A @ ( A @ inverse @ multiply ) )
= identity ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
thf(28,plain,
! [A: $i] :
( ( A @ ( A @ inverse @ multiply ) )
= identity ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(10,axiom,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ ( A @ greatest_lower_bound ) @ multiply ) )
= ( C @ ( B @ multiply ) @ ( C @ ( A @ multiply ) @ greatest_lower_bound ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb2) ).
thf(38,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ ( A @ greatest_lower_bound ) @ multiply ) )
= ( C @ ( B @ multiply ) @ ( C @ ( A @ multiply ) @ greatest_lower_bound ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(7,axiom,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ greatest_lower_bound ) @ ( A @ multiply ) )
= ( C @ ( A @ multiply ) @ ( B @ ( A @ multiply ) @ greatest_lower_bound ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb1) ).
thf(32,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ greatest_lower_bound ) @ ( A @ multiply ) )
= ( C @ ( A @ multiply ) @ ( B @ ( A @ multiply ) @ greatest_lower_bound ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(8,axiom,
( ( b @ ( a @ least_upper_bound ) )
= b ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03d_1) ).
thf(34,plain,
( ( b @ ( a @ least_upper_bound ) )
= b ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(2,axiom,
! [A: $i] :
( ( A @ ( A @ greatest_lower_bound ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_gld) ).
thf(22,plain,
! [A: $i] :
( ( A @ ( A @ greatest_lower_bound ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(13,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ least_upper_bound ) @ ( A @ greatest_lower_bound ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).
thf(44,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ least_upper_bound ) @ ( A @ greatest_lower_bound ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(11,axiom,
! [A: $i] :
( ( A @ ( A @ least_upper_bound ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_lub) ).
thf(40,plain,
! [A: $i] :
( ( A @ ( A @ least_upper_bound ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(4,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ greatest_lower_bound ) )
= ( A @ ( B @ greatest_lower_bound ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
thf(26,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ greatest_lower_bound ) )
= ( A @ ( B @ greatest_lower_bound ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(9,axiom,
( ( d @ ( c @ greatest_lower_bound ) )
= c ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03d_2) ).
thf(36,plain,
( ( d @ ( c @ greatest_lower_bound ) )
= c ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(6,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ least_upper_bound ) )
= ( A @ ( B @ least_upper_bound ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
thf(30,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ least_upper_bound ) )
= ( A @ ( B @ least_upper_bound ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(1,negated_conjecture,
( ( d @ ( b @ multiply ) @ ( c @ ( a @ multiply ) @ least_upper_bound ) )
!= ( d @ ( b @ multiply ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p03d) ).
thf(19,plain,
( ( d @ ( b @ multiply ) @ ( c @ ( a @ multiply ) @ least_upper_bound ) )
!= ( d @ ( b @ multiply ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(62,plain,
$false,
inference(e,[status(thm)],[52,46,54,48,50,42,24,28,38,32,34,22,44,40,26,36,30,19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP170-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.07/0.33 % Computer : n012.cluster.edu
% 0.07/0.33 % Model : x86_64 x86_64
% 0.07/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33 % Memory : 8046.5625MB
% 0.07/0.33 % OS : Linux 6.8.0-71-generic
% 0.07/0.33 % CPULimit : 300
% 0.07/0.33 % WCLimit : 300
% 0.07/0.33 % DateTime : Fri Sep 25 14:33:38 UTC 2026
% 0.07/0.33 % CPUTime :
% 0.07/0.33 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.38/0.61 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.68/0.70 % [INFO] Parsing done (89ms).
% 0.68/0.70 % [INFO] Running in sequential loop mode.
% 0.87/0.88 % [INFO] eprover registered as external prover.
% 0.87/0.89 % [INFO] Scanning for conjecture ...
% 1.04/0.93 % [INFO] Found a conjecture (or negated_conjecture) and 17 axioms. Running axiom selection ...
% 1.04/0.95 % [INFO] Axiom selection finished. Selected 17 axioms (removed 0 axioms).
% 1.04/0.97 % [INFO] Problem is propositional (TPTP CNF).
% 1.04/0.97 % [INFO] Type checking passed.
% 1.04/0.97 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 2.04/1.30 % External prover 'e' found a proof!
% 2.04/1.30 % [INFO] Killing All external provers ...
% 2.04/1.30 % Time passed: 888ms (effective reasoning time: 590ms)
% 2.04/1.30 % Axioms used in derivation (17): p03d_1, associativity, monotony_lub1, idempotence_of_lub, monotony_glb1, p03d_2, left_inverse, symmetry_of_glb, monotony_glb2, glb_absorbtion, idempotence_of_gld, associativity_of_glb, symmetry_of_lub, monotony_lub2, left_identity, associativity_of_lub, lub_absorbtion
% 2.04/1.30 % No. of inferences in proof: 37
% 2.04/1.30 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 888 ms resp. 590 ms w/o parsing
% 2.04/1.32 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.04/1.32 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------