TSTP Solution File: GRP190-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : GRP190-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 10:16:52 EDT 2022
% Result : Unsatisfiable 2.04s 2.29s
% Output : CNFRefutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 25
% Syntax : Number of formulae : 101 ( 94 unt; 7 typ; 0 def)
% Number of atoms : 244 ( 161 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 537 ( 6 ~; 0 |; 0 &; 531 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 182 ( 0 ^ 182 !; 0 ?; 182 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_b,type,
b: $i ).
thf(tp_greatest_lower_bound,type,
greatest_lower_bound: $i > $i > $i ).
thf(tp_identity,type,
identity: $i ).
thf(tp_inverse,type,
inverse: $i > $i ).
thf(tp_least_upper_bound,type,
least_upper_bound: $i > $i > $i ).
thf(tp_multiply,type,
multiply: $i > $i > $i ).
thf(1,axiom,
! [Y: $i,Z: $i,X: $i] :
( ( multiply @ ( greatest_lower_bound @ Y @ Z ) @ X )
= ( greatest_lower_bound @ ( multiply @ Y @ X ) @ ( multiply @ Z @ X ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb2) ).
thf(2,axiom,
! [Y: $i,Z: $i,X: $i] :
( ( multiply @ ( least_upper_bound @ Y @ Z ) @ X )
= ( least_upper_bound @ ( multiply @ Y @ X ) @ ( multiply @ Z @ X ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub2) ).
thf(3,axiom,
! [X: $i,Y: $i,Z: $i] :
( ( multiply @ X @ ( greatest_lower_bound @ Y @ Z ) )
= ( greatest_lower_bound @ ( multiply @ X @ Y ) @ ( multiply @ X @ Z ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb1) ).
thf(4,axiom,
! [X: $i,Y: $i,Z: $i] :
( ( multiply @ X @ ( least_upper_bound @ Y @ Z ) )
= ( least_upper_bound @ ( multiply @ X @ Y ) @ ( multiply @ X @ Z ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).
thf(5,axiom,
! [X: $i,Y: $i] :
( ( greatest_lower_bound @ X @ ( least_upper_bound @ X @ Y ) )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).
thf(6,axiom,
! [X: $i,Y: $i] :
( ( least_upper_bound @ X @ ( greatest_lower_bound @ X @ Y ) )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).
thf(7,axiom,
! [X: $i] :
( ( greatest_lower_bound @ X @ X )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_gld) ).
thf(8,axiom,
! [X: $i] :
( ( least_upper_bound @ X @ X )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_lub) ).
thf(9,axiom,
! [X: $i,Y: $i,Z: $i] :
( ( least_upper_bound @ X @ ( least_upper_bound @ Y @ Z ) )
= ( least_upper_bound @ ( least_upper_bound @ X @ Y ) @ Z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_lub) ).
thf(10,axiom,
! [X: $i,Y: $i,Z: $i] :
( ( greatest_lower_bound @ X @ ( greatest_lower_bound @ Y @ Z ) )
= ( greatest_lower_bound @ ( greatest_lower_bound @ X @ Y ) @ Z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_glb) ).
thf(11,axiom,
! [X: $i,Y: $i] :
( ( least_upper_bound @ X @ Y )
= ( least_upper_bound @ Y @ X ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
thf(12,axiom,
! [X: $i,Y: $i] :
( ( greatest_lower_bound @ X @ Y )
= ( greatest_lower_bound @ Y @ X ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
thf(13,axiom,
! [X: $i,Y: $i,Z: $i] :
( ( multiply @ ( multiply @ X @ Y ) @ Z )
= ( multiply @ X @ ( multiply @ Y @ Z ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).
thf(14,axiom,
! [X: $i] :
( ( multiply @ ( inverse @ X ) @ X )
= identity ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
thf(15,axiom,
! [X: $i] :
( ( multiply @ identity @ X )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
thf(16,axiom,
( ( least_upper_bound @ a @ b )
= a ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p39a_1) ).
thf(17,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(18,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[17]) ).
thf(19,negated_conjecture,
( least_upper_bound @ ( inverse @ a ) @ ( inverse @ b ) )
!= ( inverse @ b ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p39a) ).
thf(20,plain,
$false = $false,
inference(unfold_def,[status(thm)],[18]) ).
thf(21,plain,
( ( ! [Y: $i,Z: $i,X: $i] :
( ( multiply @ ( greatest_lower_bound @ Y @ Z ) @ X )
= ( greatest_lower_bound @ ( multiply @ Y @ X ) @ ( multiply @ Z @ X ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(22,plain,
( ( ! [Y: $i,Z: $i,X: $i] :
( ( multiply @ ( least_upper_bound @ Y @ Z ) @ X )
= ( least_upper_bound @ ( multiply @ Y @ X ) @ ( multiply @ Z @ X ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(23,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( multiply @ X @ ( greatest_lower_bound @ Y @ Z ) )
= ( greatest_lower_bound @ ( multiply @ X @ Y ) @ ( multiply @ X @ Z ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(24,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( multiply @ X @ ( least_upper_bound @ Y @ Z ) )
= ( least_upper_bound @ ( multiply @ X @ Y ) @ ( multiply @ X @ Z ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(25,plain,
( ( ! [X: $i,Y: $i] :
( ( greatest_lower_bound @ X @ ( least_upper_bound @ X @ Y ) )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(26,plain,
( ( ! [X: $i,Y: $i] :
( ( least_upper_bound @ X @ ( greatest_lower_bound @ X @ Y ) )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(27,plain,
( ( ! [X: $i] :
( ( greatest_lower_bound @ X @ X )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(28,plain,
( ( ! [X: $i] :
( ( least_upper_bound @ X @ X )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(29,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( least_upper_bound @ X @ ( least_upper_bound @ Y @ Z ) )
= ( least_upper_bound @ ( least_upper_bound @ X @ Y ) @ Z ) ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(30,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( greatest_lower_bound @ X @ ( greatest_lower_bound @ Y @ Z ) )
= ( greatest_lower_bound @ ( greatest_lower_bound @ X @ Y ) @ Z ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(31,plain,
( ( ! [X: $i,Y: $i] :
( ( least_upper_bound @ X @ Y )
= ( least_upper_bound @ Y @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(32,plain,
( ( ! [X: $i,Y: $i] :
( ( greatest_lower_bound @ X @ Y )
= ( greatest_lower_bound @ Y @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(33,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( multiply @ ( multiply @ X @ Y ) @ Z )
= ( multiply @ X @ ( multiply @ Y @ Z ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[13]) ).
thf(34,plain,
( ( ! [X: $i] :
( ( multiply @ ( inverse @ X ) @ X )
= identity ) )
= $true ),
inference(unfold_def,[status(thm)],[14]) ).
thf(35,plain,
( ( ! [X: $i] :
( ( multiply @ identity @ X )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[15]) ).
thf(36,plain,
( ( ( least_upper_bound @ a @ b )
= a )
= $true ),
inference(unfold_def,[status(thm)],[16]) ).
thf(37,plain,
( ( ( ( least_upper_bound @ ( inverse @ a ) @ ( inverse @ b ) )
!= ( inverse @ b ) ) )
= $true ),
inference(unfold_def,[status(thm)],[19]) ).
thf(38,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[20]) ).
thf(39,plain,
( ( ( ( least_upper_bound @ ( inverse @ a ) @ ( inverse @ b ) )
!= ( inverse @ b ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[37]) ).
thf(40,plain,
( ( ( ( least_upper_bound @ ( inverse @ a ) @ ( inverse @ b ) )
!= ( inverse @ b ) ) )
= $true ),
inference(copy,[status(thm)],[39]) ).
thf(41,plain,
( ( ( least_upper_bound @ a @ b )
= a )
= $true ),
inference(copy,[status(thm)],[36]) ).
thf(42,plain,
( ( ! [X: $i] :
( ( multiply @ identity @ X )
= X ) )
= $true ),
inference(copy,[status(thm)],[35]) ).
thf(43,plain,
( ( ! [X: $i] :
( ( multiply @ ( inverse @ X ) @ X )
= identity ) )
= $true ),
inference(copy,[status(thm)],[34]) ).
thf(44,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( multiply @ ( multiply @ X @ Y ) @ Z )
= ( multiply @ X @ ( multiply @ Y @ Z ) ) ) )
= $true ),
inference(copy,[status(thm)],[33]) ).
thf(45,plain,
( ( ! [X: $i,Y: $i] :
( ( greatest_lower_bound @ X @ Y )
= ( greatest_lower_bound @ Y @ X ) ) )
= $true ),
inference(copy,[status(thm)],[32]) ).
thf(46,plain,
( ( ! [X: $i,Y: $i] :
( ( least_upper_bound @ X @ Y )
= ( least_upper_bound @ Y @ X ) ) )
= $true ),
inference(copy,[status(thm)],[31]) ).
thf(47,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( greatest_lower_bound @ X @ ( greatest_lower_bound @ Y @ Z ) )
= ( greatest_lower_bound @ ( greatest_lower_bound @ X @ Y ) @ Z ) ) )
= $true ),
inference(copy,[status(thm)],[30]) ).
thf(48,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( least_upper_bound @ X @ ( least_upper_bound @ Y @ Z ) )
= ( least_upper_bound @ ( least_upper_bound @ X @ Y ) @ Z ) ) )
= $true ),
inference(copy,[status(thm)],[29]) ).
thf(49,plain,
( ( ! [X: $i] :
( ( least_upper_bound @ X @ X )
= X ) )
= $true ),
inference(copy,[status(thm)],[28]) ).
thf(50,plain,
( ( ! [X: $i] :
( ( greatest_lower_bound @ X @ X )
= X ) )
= $true ),
inference(copy,[status(thm)],[27]) ).
thf(51,plain,
( ( ! [X: $i,Y: $i] :
( ( least_upper_bound @ X @ ( greatest_lower_bound @ X @ Y ) )
= X ) )
= $true ),
inference(copy,[status(thm)],[26]) ).
thf(52,plain,
( ( ! [X: $i,Y: $i] :
( ( greatest_lower_bound @ X @ ( least_upper_bound @ X @ Y ) )
= X ) )
= $true ),
inference(copy,[status(thm)],[25]) ).
thf(53,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( multiply @ X @ ( least_upper_bound @ Y @ Z ) )
= ( least_upper_bound @ ( multiply @ X @ Y ) @ ( multiply @ X @ Z ) ) ) )
= $true ),
inference(copy,[status(thm)],[24]) ).
thf(54,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( multiply @ X @ ( greatest_lower_bound @ Y @ Z ) )
= ( greatest_lower_bound @ ( multiply @ X @ Y ) @ ( multiply @ X @ Z ) ) ) )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(55,plain,
( ( ! [Y: $i,Z: $i,X: $i] :
( ( multiply @ ( least_upper_bound @ Y @ Z ) @ X )
= ( least_upper_bound @ ( multiply @ Y @ X ) @ ( multiply @ Z @ X ) ) ) )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(56,plain,
( ( ! [Y: $i,Z: $i,X: $i] :
( ( multiply @ ( greatest_lower_bound @ Y @ Z ) @ X )
= ( greatest_lower_bound @ ( multiply @ Y @ X ) @ ( multiply @ Z @ X ) ) ) )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(57,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[38]) ).
thf(58,plain,
( ( ( least_upper_bound @ ( inverse @ a ) @ ( inverse @ b ) )
= ( inverse @ b ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[40]) ).
thf(59,plain,
! [SV1: $i] :
( ( ( multiply @ identity @ SV1 )
= SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[42]) ).
thf(60,plain,
! [SV2: $i] :
( ( ( multiply @ ( inverse @ SV2 ) @ SV2 )
= identity )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[43]) ).
thf(61,plain,
! [SV3: $i] :
( ( ! [SY33: $i,SY34: $i] :
( ( multiply @ ( multiply @ SV3 @ SY33 ) @ SY34 )
= ( multiply @ SV3 @ ( multiply @ SY33 @ SY34 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[44]) ).
thf(62,plain,
! [SV4: $i] :
( ( ! [SY35: $i] :
( ( greatest_lower_bound @ SV4 @ SY35 )
= ( greatest_lower_bound @ SY35 @ SV4 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[45]) ).
thf(63,plain,
! [SV5: $i] :
( ( ! [SY36: $i] :
( ( least_upper_bound @ SV5 @ SY36 )
= ( least_upper_bound @ SY36 @ SV5 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[46]) ).
thf(64,plain,
! [SV6: $i] :
( ( ! [SY37: $i,SY38: $i] :
( ( greatest_lower_bound @ SV6 @ ( greatest_lower_bound @ SY37 @ SY38 ) )
= ( greatest_lower_bound @ ( greatest_lower_bound @ SV6 @ SY37 ) @ SY38 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[47]) ).
thf(65,plain,
! [SV7: $i] :
( ( ! [SY39: $i,SY40: $i] :
( ( least_upper_bound @ SV7 @ ( least_upper_bound @ SY39 @ SY40 ) )
= ( least_upper_bound @ ( least_upper_bound @ SV7 @ SY39 ) @ SY40 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[48]) ).
thf(66,plain,
! [SV8: $i] :
( ( ( least_upper_bound @ SV8 @ SV8 )
= SV8 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[49]) ).
thf(67,plain,
! [SV9: $i] :
( ( ( greatest_lower_bound @ SV9 @ SV9 )
= SV9 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[50]) ).
thf(68,plain,
! [SV10: $i] :
( ( ! [SY41: $i] :
( ( least_upper_bound @ SV10 @ ( greatest_lower_bound @ SV10 @ SY41 ) )
= SV10 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[51]) ).
thf(69,plain,
! [SV11: $i] :
( ( ! [SY42: $i] :
( ( greatest_lower_bound @ SV11 @ ( least_upper_bound @ SV11 @ SY42 ) )
= SV11 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[52]) ).
thf(70,plain,
! [SV12: $i] :
( ( ! [SY43: $i,SY44: $i] :
( ( multiply @ SV12 @ ( least_upper_bound @ SY43 @ SY44 ) )
= ( least_upper_bound @ ( multiply @ SV12 @ SY43 ) @ ( multiply @ SV12 @ SY44 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[53]) ).
thf(71,plain,
! [SV13: $i] :
( ( ! [SY45: $i,SY46: $i] :
( ( multiply @ SV13 @ ( greatest_lower_bound @ SY45 @ SY46 ) )
= ( greatest_lower_bound @ ( multiply @ SV13 @ SY45 ) @ ( multiply @ SV13 @ SY46 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[54]) ).
thf(72,plain,
! [SV14: $i] :
( ( ! [SY47: $i,SY48: $i] :
( ( multiply @ ( least_upper_bound @ SV14 @ SY47 ) @ SY48 )
= ( least_upper_bound @ ( multiply @ SV14 @ SY48 ) @ ( multiply @ SY47 @ SY48 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[55]) ).
thf(73,plain,
! [SV15: $i] :
( ( ! [SY49: $i,SY50: $i] :
( ( multiply @ ( greatest_lower_bound @ SV15 @ SY49 ) @ SY50 )
= ( greatest_lower_bound @ ( multiply @ SV15 @ SY50 ) @ ( multiply @ SY49 @ SY50 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[56]) ).
thf(74,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[57]) ).
thf(75,plain,
! [SV16: $i,SV3: $i] :
( ( ! [SY51: $i] :
( ( multiply @ ( multiply @ SV3 @ SV16 ) @ SY51 )
= ( multiply @ SV3 @ ( multiply @ SV16 @ SY51 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[61]) ).
thf(76,plain,
! [SV17: $i,SV4: $i] :
( ( ( greatest_lower_bound @ SV4 @ SV17 )
= ( greatest_lower_bound @ SV17 @ SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[62]) ).
thf(77,plain,
! [SV18: $i,SV5: $i] :
( ( ( least_upper_bound @ SV5 @ SV18 )
= ( least_upper_bound @ SV18 @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[63]) ).
thf(78,plain,
! [SV19: $i,SV6: $i] :
( ( ! [SY52: $i] :
( ( greatest_lower_bound @ SV6 @ ( greatest_lower_bound @ SV19 @ SY52 ) )
= ( greatest_lower_bound @ ( greatest_lower_bound @ SV6 @ SV19 ) @ SY52 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[64]) ).
thf(79,plain,
! [SV20: $i,SV7: $i] :
( ( ! [SY53: $i] :
( ( least_upper_bound @ SV7 @ ( least_upper_bound @ SV20 @ SY53 ) )
= ( least_upper_bound @ ( least_upper_bound @ SV7 @ SV20 ) @ SY53 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[65]) ).
thf(80,plain,
! [SV21: $i,SV10: $i] :
( ( ( least_upper_bound @ SV10 @ ( greatest_lower_bound @ SV10 @ SV21 ) )
= SV10 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[68]) ).
thf(81,plain,
! [SV22: $i,SV11: $i] :
( ( ( greatest_lower_bound @ SV11 @ ( least_upper_bound @ SV11 @ SV22 ) )
= SV11 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[69]) ).
thf(82,plain,
! [SV23: $i,SV12: $i] :
( ( ! [SY54: $i] :
( ( multiply @ SV12 @ ( least_upper_bound @ SV23 @ SY54 ) )
= ( least_upper_bound @ ( multiply @ SV12 @ SV23 ) @ ( multiply @ SV12 @ SY54 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[70]) ).
thf(83,plain,
! [SV24: $i,SV13: $i] :
( ( ! [SY55: $i] :
( ( multiply @ SV13 @ ( greatest_lower_bound @ SV24 @ SY55 ) )
= ( greatest_lower_bound @ ( multiply @ SV13 @ SV24 ) @ ( multiply @ SV13 @ SY55 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[71]) ).
thf(84,plain,
! [SV25: $i,SV14: $i] :
( ( ! [SY56: $i] :
( ( multiply @ ( least_upper_bound @ SV14 @ SV25 ) @ SY56 )
= ( least_upper_bound @ ( multiply @ SV14 @ SY56 ) @ ( multiply @ SV25 @ SY56 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[72]) ).
thf(85,plain,
! [SV26: $i,SV15: $i] :
( ( ! [SY57: $i] :
( ( multiply @ ( greatest_lower_bound @ SV15 @ SV26 ) @ SY57 )
= ( greatest_lower_bound @ ( multiply @ SV15 @ SY57 ) @ ( multiply @ SV26 @ SY57 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[73]) ).
thf(86,plain,
! [SV27: $i,SV16: $i,SV3: $i] :
( ( ( multiply @ ( multiply @ SV3 @ SV16 ) @ SV27 )
= ( multiply @ SV3 @ ( multiply @ SV16 @ SV27 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[75]) ).
thf(87,plain,
! [SV28: $i,SV19: $i,SV6: $i] :
( ( ( greatest_lower_bound @ SV6 @ ( greatest_lower_bound @ SV19 @ SV28 ) )
= ( greatest_lower_bound @ ( greatest_lower_bound @ SV6 @ SV19 ) @ SV28 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[78]) ).
thf(88,plain,
! [SV29: $i,SV20: $i,SV7: $i] :
( ( ( least_upper_bound @ SV7 @ ( least_upper_bound @ SV20 @ SV29 ) )
= ( least_upper_bound @ ( least_upper_bound @ SV7 @ SV20 ) @ SV29 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[79]) ).
thf(89,plain,
! [SV30: $i,SV23: $i,SV12: $i] :
( ( ( multiply @ SV12 @ ( least_upper_bound @ SV23 @ SV30 ) )
= ( least_upper_bound @ ( multiply @ SV12 @ SV23 ) @ ( multiply @ SV12 @ SV30 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[82]) ).
thf(90,plain,
! [SV31: $i,SV24: $i,SV13: $i] :
( ( ( multiply @ SV13 @ ( greatest_lower_bound @ SV24 @ SV31 ) )
= ( greatest_lower_bound @ ( multiply @ SV13 @ SV24 ) @ ( multiply @ SV13 @ SV31 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[83]) ).
thf(91,plain,
! [SV32: $i,SV25: $i,SV14: $i] :
( ( ( multiply @ ( least_upper_bound @ SV14 @ SV25 ) @ SV32 )
= ( least_upper_bound @ ( multiply @ SV14 @ SV32 ) @ ( multiply @ SV25 @ SV32 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[84]) ).
thf(92,plain,
! [SV33: $i,SV26: $i,SV15: $i] :
( ( ( multiply @ ( greatest_lower_bound @ SV15 @ SV26 ) @ SV33 )
= ( greatest_lower_bound @ ( multiply @ SV15 @ SV33 ) @ ( multiply @ SV26 @ SV33 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[85]) ).
thf(93,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[41,92,91,90,89,88,87,86,81,80,77,76,74,67,66,60,59,58]) ).
thf(94,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP190-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.14 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 13:04:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37
% 0.13/0.37 No.of.Axioms: 17
% 0.13/0.37
% 0.13/0.37 Length.of.Defs: 0
% 0.13/0.37
% 0.13/0.37 Contains.Choice.Funs: false
% 0.13/0.37 (rf:0,axioms:17,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:19,loop_count:0,foatp_calls:0,translation:fof_full).....
% 2.04/2.29
% 2.04/2.29 ********************************
% 2.04/2.29 * All subproblems solved! *
% 2.04/2.29 ********************************
% 2.04/2.29 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:17,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:93,loop_count:0,foatp_calls:1,translation:fof_full)
% 2.04/2.30
% 2.04/2.30 %**** Beginning of derivation protocol ****
% 2.04/2.30 % SZS output start CNFRefutation
% See solution above
% 2.04/2.30
% 2.04/2.30 %**** End of derivation protocol ****
% 2.04/2.30 %**** no. of clauses in derivation: 94 ****
% 2.04/2.30 %**** clause counter: 93 ****
% 2.04/2.30
% 2.04/2.30 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:17,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:93,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------