TSTP Solution File: SYO179^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO179^5 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n022.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 : Thu Jul 21 17:32:34 EDT 2022
% Result : Theorem 0.76s 0.96s
% Output : CNFRefutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 99 ( 65 unt; 8 typ; 0 def)
% Number of atoms : 570 ( 122 equ; 0 cnn)
% Maximal formula atoms : 36 ( 6 avg)
% Number of connectives : 963 ( 80 ~; 168 |; 64 &; 648 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 8 con; 0-2 aty)
% Number of variables : 114 ( 0 ^ 84 !; 30 ?; 114 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_cA,type,
cA: $i ).
thf(tp_cB,type,
cB: $i ).
thf(tp_cC,type,
cC: $i ).
thf(tp_cD,type,
cD: $i ).
thf(tp_cE,type,
cE: $i ).
thf(tp_cF,type,
cF: $i ).
thf(tp_cG,type,
cG: $i > $i > $o ).
thf(tp_cR,type,
cR: $i > $i > $o ).
thf(1,conjecture,
( ( ( ( cR @ cA @ cB )
| ( cG @ cA @ cB ) )
& ( ( cR @ cA @ cC )
| ( cG @ cA @ cC ) )
& ( ( cR @ cA @ cD )
| ( cG @ cA @ cD ) )
& ( ( cR @ cA @ cE )
| ( cG @ cA @ cE ) )
& ( ( cR @ cA @ cF )
| ( cG @ cA @ cF ) )
& ( ( cR @ cB @ cC )
| ( cG @ cB @ cC ) )
& ( ( cR @ cB @ cD )
| ( cG @ cB @ cD ) )
& ( ( cR @ cB @ cE )
| ( cG @ cB @ cE ) )
& ( ( cR @ cB @ cF )
| ( cG @ cB @ cF ) )
& ( ( cR @ cC @ cD )
| ( cG @ cC @ cD ) )
& ( ( cR @ cC @ cE )
| ( cG @ cC @ cE ) )
& ( ( cR @ cC @ cF )
| ( cG @ cC @ cF ) )
& ( ( cR @ cD @ cE )
| ( cG @ cD @ cE ) )
& ( ( cR @ cD @ cF )
| ( cG @ cD @ cF ) )
& ( ( cR @ cE @ cF )
| ( cG @ cE @ cF ) ) )
=> ( ? [Xa: $i,Xb: $i,Xc: $i] :
( ( cR @ Xa @ Xb )
& ( cR @ Xa @ Xc )
& ( cR @ Xb @ Xc ) )
| ? [Xa: $i,Xb: $i,Xc: $i] :
( ( cG @ Xa @ Xb )
& ( cG @ Xa @ Xc )
& ( cG @ Xb @ Xc ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cSIX_THEOREM_B) ).
thf(2,negated_conjecture,
( ( ( ( ( cR @ cA @ cB )
| ( cG @ cA @ cB ) )
& ( ( cR @ cA @ cC )
| ( cG @ cA @ cC ) )
& ( ( cR @ cA @ cD )
| ( cG @ cA @ cD ) )
& ( ( cR @ cA @ cE )
| ( cG @ cA @ cE ) )
& ( ( cR @ cA @ cF )
| ( cG @ cA @ cF ) )
& ( ( cR @ cB @ cC )
| ( cG @ cB @ cC ) )
& ( ( cR @ cB @ cD )
| ( cG @ cB @ cD ) )
& ( ( cR @ cB @ cE )
| ( cG @ cB @ cE ) )
& ( ( cR @ cB @ cF )
| ( cG @ cB @ cF ) )
& ( ( cR @ cC @ cD )
| ( cG @ cC @ cD ) )
& ( ( cR @ cC @ cE )
| ( cG @ cC @ cE ) )
& ( ( cR @ cC @ cF )
| ( cG @ cC @ cF ) )
& ( ( cR @ cD @ cE )
| ( cG @ cD @ cE ) )
& ( ( cR @ cD @ cF )
| ( cG @ cD @ cF ) )
& ( ( cR @ cE @ cF )
| ( cG @ cE @ cF ) ) )
=> ( ? [Xa: $i,Xb: $i,Xc: $i] :
( ( cR @ Xa @ Xb )
& ( cR @ Xa @ Xc )
& ( cR @ Xb @ Xc ) )
| ? [Xa: $i,Xb: $i,Xc: $i] :
( ( cG @ Xa @ Xb )
& ( cG @ Xa @ Xc )
& ( cG @ Xb @ Xc ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ( ( cR @ cA @ cB )
| ( cG @ cA @ cB ) )
& ( ( cR @ cA @ cC )
| ( cG @ cA @ cC ) )
& ( ( cR @ cA @ cD )
| ( cG @ cA @ cD ) )
& ( ( cR @ cA @ cE )
| ( cG @ cA @ cE ) )
& ( ( cR @ cA @ cF )
| ( cG @ cA @ cF ) )
& ( ( cR @ cB @ cC )
| ( cG @ cB @ cC ) )
& ( ( cR @ cB @ cD )
| ( cG @ cB @ cD ) )
& ( ( cR @ cB @ cE )
| ( cG @ cB @ cE ) )
& ( ( cR @ cB @ cF )
| ( cG @ cB @ cF ) )
& ( ( cR @ cC @ cD )
| ( cG @ cC @ cD ) )
& ( ( cR @ cC @ cE )
| ( cG @ cC @ cE ) )
& ( ( cR @ cC @ cF )
| ( cG @ cC @ cF ) )
& ( ( cR @ cD @ cE )
| ( cG @ cD @ cE ) )
& ( ( cR @ cD @ cF )
| ( cG @ cD @ cF ) )
& ( ( cR @ cE @ cF )
| ( cG @ cE @ cF ) ) )
=> ( ? [Xa: $i,Xb: $i,Xc: $i] :
( ( cR @ Xa @ Xb )
& ( cR @ Xa @ Xc )
& ( cR @ Xb @ Xc ) )
| ? [Xa: $i,Xb: $i,Xc: $i] :
( ( cG @ Xa @ Xb )
& ( cG @ Xa @ Xc )
& ( cG @ Xb @ Xc ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ( cR @ cA @ cB )
| ( cG @ cA @ cB ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ( cR @ cA @ cC )
| ( cG @ cA @ cC ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ( cR @ cA @ cD )
| ( cG @ cA @ cD ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ( cR @ cA @ cE )
| ( cG @ cA @ cE ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(8,plain,
( ( ( cR @ cA @ cF )
| ( cG @ cA @ cF ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(9,plain,
( ( ( cR @ cB @ cC )
| ( cG @ cB @ cC ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(10,plain,
( ( ( cR @ cB @ cD )
| ( cG @ cB @ cD ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(11,plain,
( ( ( cR @ cB @ cE )
| ( cG @ cB @ cE ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(12,plain,
( ( ( cR @ cB @ cF )
| ( cG @ cB @ cF ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(13,plain,
( ( ( cR @ cC @ cD )
| ( cG @ cC @ cD ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(14,plain,
( ( ( cR @ cC @ cE )
| ( cG @ cC @ cE ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(15,plain,
( ( ( cR @ cC @ cF )
| ( cG @ cC @ cF ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(16,plain,
( ( ( cR @ cD @ cE )
| ( cG @ cD @ cE ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(17,plain,
( ( ( cR @ cD @ cF )
| ( cG @ cD @ cF ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(18,plain,
( ( ( cR @ cE @ cF )
| ( cG @ cE @ cF ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(19,plain,
( ( ? [Xa: $i,Xb: $i,Xc: $i] :
( ( cR @ Xa @ Xb )
& ( cR @ Xa @ Xc )
& ( cR @ Xb @ Xc ) )
| ? [Xa: $i,Xb: $i,Xc: $i] :
( ( cG @ Xa @ Xb )
& ( cG @ Xa @ Xc )
& ( cG @ Xb @ Xc ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(20,plain,
( ( ~ ( ? [Xa: $i,Xb: $i,Xc: $i] :
( ( cR @ Xa @ Xb )
& ( cR @ Xa @ Xc )
& ( cR @ Xb @ Xc ) )
| ? [Xa: $i,Xb: $i,Xc: $i] :
( ( cG @ Xa @ Xb )
& ( cG @ Xa @ Xc )
& ( cG @ Xb @ Xc ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[19]) ).
thf(21,plain,
( ( ! [Xa: $i,Xb: $i,Xc: $i] :
( ~ ( cR @ Xa @ Xb )
| ~ ( cR @ Xa @ Xc )
| ~ ( cR @ Xb @ Xc ) )
& ! [Xa: $i,Xb: $i,Xc: $i] :
( ~ ( cG @ Xa @ Xb )
| ~ ( cG @ Xa @ Xc )
| ~ ( cG @ Xb @ Xc ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[20]) ).
thf(22,plain,
( ( ( cG @ cA @ cB )
| ( cR @ cA @ cB ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(23,plain,
( ( ( cG @ cA @ cC )
| ( cR @ cA @ cC ) )
= $true ),
inference(extcnf_combined,[status(esa)],[5]) ).
thf(24,plain,
( ( ( cG @ cA @ cD )
| ( cR @ cA @ cD ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(25,plain,
( ( ( cG @ cA @ cE )
| ( cR @ cA @ cE ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(26,plain,
( ( ( cG @ cA @ cF )
| ( cR @ cA @ cF ) )
= $true ),
inference(extcnf_combined,[status(esa)],[8]) ).
thf(27,plain,
( ( ( cG @ cB @ cC )
| ( cR @ cB @ cC ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(28,plain,
( ( ( cG @ cB @ cD )
| ( cR @ cB @ cD ) )
= $true ),
inference(extcnf_combined,[status(esa)],[10]) ).
thf(29,plain,
( ( ( cG @ cB @ cE )
| ( cR @ cB @ cE ) )
= $true ),
inference(extcnf_combined,[status(esa)],[11]) ).
thf(30,plain,
( ( ( cG @ cB @ cF )
| ( cR @ cB @ cF ) )
= $true ),
inference(extcnf_combined,[status(esa)],[12]) ).
thf(31,plain,
( ( ( cG @ cC @ cD )
| ( cR @ cC @ cD ) )
= $true ),
inference(extcnf_combined,[status(esa)],[13]) ).
thf(32,plain,
( ( ( cG @ cC @ cE )
| ( cR @ cC @ cE ) )
= $true ),
inference(extcnf_combined,[status(esa)],[14]) ).
thf(33,plain,
( ( ( cG @ cC @ cF )
| ( cR @ cC @ cF ) )
= $true ),
inference(extcnf_combined,[status(esa)],[15]) ).
thf(34,plain,
( ( ( cG @ cD @ cE )
| ( cR @ cD @ cE ) )
= $true ),
inference(extcnf_combined,[status(esa)],[16]) ).
thf(35,plain,
( ( ( cG @ cD @ cF )
| ( cR @ cD @ cF ) )
= $true ),
inference(extcnf_combined,[status(esa)],[17]) ).
thf(36,plain,
( ( ( cG @ cE @ cF )
| ( cR @ cE @ cF ) )
= $true ),
inference(extcnf_combined,[status(esa)],[18]) ).
thf(37,plain,
( ( ( cG @ cE @ cF )
| ( cR @ cE @ cF ) )
= $true ),
inference(copy,[status(thm)],[36]) ).
thf(38,plain,
( ( ( cG @ cD @ cF )
| ( cR @ cD @ cF ) )
= $true ),
inference(copy,[status(thm)],[35]) ).
thf(39,plain,
( ( ( cG @ cD @ cE )
| ( cR @ cD @ cE ) )
= $true ),
inference(copy,[status(thm)],[34]) ).
thf(40,plain,
( ( ( cG @ cC @ cF )
| ( cR @ cC @ cF ) )
= $true ),
inference(copy,[status(thm)],[33]) ).
thf(41,plain,
( ( ( cG @ cC @ cE )
| ( cR @ cC @ cE ) )
= $true ),
inference(copy,[status(thm)],[32]) ).
thf(42,plain,
( ( ( cG @ cC @ cD )
| ( cR @ cC @ cD ) )
= $true ),
inference(copy,[status(thm)],[31]) ).
thf(43,plain,
( ( ( cG @ cB @ cF )
| ( cR @ cB @ cF ) )
= $true ),
inference(copy,[status(thm)],[30]) ).
thf(44,plain,
( ( ( cG @ cB @ cE )
| ( cR @ cB @ cE ) )
= $true ),
inference(copy,[status(thm)],[29]) ).
thf(45,plain,
( ( ( cG @ cB @ cD )
| ( cR @ cB @ cD ) )
= $true ),
inference(copy,[status(thm)],[28]) ).
thf(46,plain,
( ( ( cG @ cB @ cC )
| ( cR @ cB @ cC ) )
= $true ),
inference(copy,[status(thm)],[27]) ).
thf(47,plain,
( ( ( cG @ cA @ cF )
| ( cR @ cA @ cF ) )
= $true ),
inference(copy,[status(thm)],[26]) ).
thf(48,plain,
( ( ( cG @ cA @ cE )
| ( cR @ cA @ cE ) )
= $true ),
inference(copy,[status(thm)],[25]) ).
thf(49,plain,
( ( ( cG @ cA @ cD )
| ( cR @ cA @ cD ) )
= $true ),
inference(copy,[status(thm)],[24]) ).
thf(50,plain,
( ( ( cG @ cA @ cC )
| ( cR @ cA @ cC ) )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(51,plain,
( ( ( cG @ cA @ cB )
| ( cR @ cA @ cB ) )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(52,plain,
( ( ! [Xa: $i,Xb: $i,Xc: $i] :
( ~ ( cR @ Xa @ Xb )
| ~ ( cR @ Xa @ Xc )
| ~ ( cR @ Xb @ Xc ) )
& ! [Xa: $i,Xb: $i,Xc: $i] :
( ~ ( cG @ Xa @ Xb )
| ~ ( cG @ Xa @ Xc )
| ~ ( cG @ Xb @ Xc ) ) )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(53,plain,
( ( ~ ( ~ ! [SX0: $i,SX1: $i,SX2: $i] :
( ~ ( cR @ SX0 @ SX1 )
| ~ ( cR @ SX0 @ SX2 )
| ~ ( cR @ SX1 @ SX2 ) )
| ~ ! [SX0: $i,SX1: $i,SX2: $i] :
( ~ ( cG @ SX0 @ SX1 )
| ~ ( cG @ SX0 @ SX2 )
| ~ ( cG @ SX1 @ SX2 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[52]) ).
thf(54,plain,
( ( ( cG @ cE @ cF )
= $true )
| ( ( cR @ cE @ cF )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[37]) ).
thf(55,plain,
( ( ( cG @ cD @ cF )
= $true )
| ( ( cR @ cD @ cF )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[38]) ).
thf(56,plain,
( ( ( cG @ cD @ cE )
= $true )
| ( ( cR @ cD @ cE )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[39]) ).
thf(57,plain,
( ( ( cG @ cC @ cF )
= $true )
| ( ( cR @ cC @ cF )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[40]) ).
thf(58,plain,
( ( ( cG @ cC @ cE )
= $true )
| ( ( cR @ cC @ cE )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[41]) ).
thf(59,plain,
( ( ( cG @ cC @ cD )
= $true )
| ( ( cR @ cC @ cD )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[42]) ).
thf(60,plain,
( ( ( cG @ cB @ cF )
= $true )
| ( ( cR @ cB @ cF )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[43]) ).
thf(61,plain,
( ( ( cG @ cB @ cE )
= $true )
| ( ( cR @ cB @ cE )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[44]) ).
thf(62,plain,
( ( ( cG @ cB @ cD )
= $true )
| ( ( cR @ cB @ cD )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[45]) ).
thf(63,plain,
( ( ( cG @ cB @ cC )
= $true )
| ( ( cR @ cB @ cC )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[46]) ).
thf(64,plain,
( ( ( cG @ cA @ cF )
= $true )
| ( ( cR @ cA @ cF )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[47]) ).
thf(65,plain,
( ( ( cG @ cA @ cE )
= $true )
| ( ( cR @ cA @ cE )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[48]) ).
thf(66,plain,
( ( ( cG @ cA @ cD )
= $true )
| ( ( cR @ cA @ cD )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[49]) ).
thf(67,plain,
( ( ( cG @ cA @ cC )
= $true )
| ( ( cR @ cA @ cC )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[50]) ).
thf(68,plain,
( ( ( cG @ cA @ cB )
= $true )
| ( ( cR @ cA @ cB )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[51]) ).
thf(69,plain,
( ( ~ ! [SX0: $i,SX1: $i,SX2: $i] :
( ~ ( cR @ SX0 @ SX1 )
| ~ ( cR @ SX0 @ SX2 )
| ~ ( cR @ SX1 @ SX2 ) )
| ~ ! [SX0: $i,SX1: $i,SX2: $i] :
( ~ ( cG @ SX0 @ SX1 )
| ~ ( cG @ SX0 @ SX2 )
| ~ ( cG @ SX1 @ SX2 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[53]) ).
thf(70,plain,
( ( ~ ! [SX0: $i,SX1: $i,SX2: $i] :
( ~ ( cR @ SX0 @ SX1 )
| ~ ( cR @ SX0 @ SX2 )
| ~ ( cR @ SX1 @ SX2 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[69]) ).
thf(71,plain,
( ( ~ ! [SX0: $i,SX1: $i,SX2: $i] :
( ~ ( cG @ SX0 @ SX1 )
| ~ ( cG @ SX0 @ SX2 )
| ~ ( cG @ SX1 @ SX2 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[69]) ).
thf(72,plain,
( ( ! [SX0: $i,SX1: $i,SX2: $i] :
( ~ ( cR @ SX0 @ SX1 )
| ~ ( cR @ SX0 @ SX2 )
| ~ ( cR @ SX1 @ SX2 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[70]) ).
thf(73,plain,
( ( ! [SX0: $i,SX1: $i,SX2: $i] :
( ~ ( cG @ SX0 @ SX1 )
| ~ ( cG @ SX0 @ SX2 )
| ~ ( cG @ SX1 @ SX2 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[71]) ).
thf(74,plain,
! [SV1: $i] :
( ( ! [SY6: $i,SY7: $i] :
( ~ ( cR @ SV1 @ SY6 )
| ~ ( cR @ SV1 @ SY7 )
| ~ ( cR @ SY6 @ SY7 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[72]) ).
thf(75,plain,
! [SV2: $i] :
( ( ! [SY8: $i,SY9: $i] :
( ~ ( cG @ SV2 @ SY8 )
| ~ ( cG @ SV2 @ SY9 )
| ~ ( cG @ SY8 @ SY9 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[73]) ).
thf(76,plain,
! [SV3: $i,SV1: $i] :
( ( ! [SY10: $i] :
( ~ ( cR @ SV1 @ SV3 )
| ~ ( cR @ SV1 @ SY10 )
| ~ ( cR @ SV3 @ SY10 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[74]) ).
thf(77,plain,
! [SV4: $i,SV2: $i] :
( ( ! [SY11: $i] :
( ~ ( cG @ SV2 @ SV4 )
| ~ ( cG @ SV2 @ SY11 )
| ~ ( cG @ SV4 @ SY11 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[75]) ).
thf(78,plain,
! [SV5: $i,SV3: $i,SV1: $i] :
( ( ~ ( cR @ SV1 @ SV3 )
| ~ ( cR @ SV1 @ SV5 )
| ~ ( cR @ SV3 @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[76]) ).
thf(79,plain,
! [SV6: $i,SV4: $i,SV2: $i] :
( ( ~ ( cG @ SV2 @ SV4 )
| ~ ( cG @ SV2 @ SV6 )
| ~ ( cG @ SV4 @ SV6 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[77]) ).
thf(80,plain,
! [SV5: $i,SV3: $i,SV1: $i] :
( ( ( ~ ( cR @ SV1 @ SV3 )
| ~ ( cR @ SV1 @ SV5 ) )
= $true )
| ( ( ~ ( cR @ SV3 @ SV5 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[78]) ).
thf(81,plain,
! [SV6: $i,SV4: $i,SV2: $i] :
( ( ( ~ ( cG @ SV2 @ SV4 )
| ~ ( cG @ SV2 @ SV6 ) )
= $true )
| ( ( ~ ( cG @ SV4 @ SV6 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[79]) ).
thf(82,plain,
! [SV5: $i,SV3: $i,SV1: $i] :
( ( ( ~ ( cR @ SV1 @ SV3 ) )
= $true )
| ( ( ~ ( cR @ SV1 @ SV5 ) )
= $true )
| ( ( ~ ( cR @ SV3 @ SV5 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[80]) ).
thf(83,plain,
! [SV6: $i,SV4: $i,SV2: $i] :
( ( ( ~ ( cG @ SV2 @ SV4 ) )
= $true )
| ( ( ~ ( cG @ SV2 @ SV6 ) )
= $true )
| ( ( ~ ( cG @ SV4 @ SV6 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[81]) ).
thf(84,plain,
! [SV5: $i,SV3: $i,SV1: $i] :
( ( ( cR @ SV1 @ SV3 )
= $false )
| ( ( ~ ( cR @ SV1 @ SV5 ) )
= $true )
| ( ( ~ ( cR @ SV3 @ SV5 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[82]) ).
thf(85,plain,
! [SV6: $i,SV4: $i,SV2: $i] :
( ( ( cG @ SV2 @ SV4 )
= $false )
| ( ( ~ ( cG @ SV2 @ SV6 ) )
= $true )
| ( ( ~ ( cG @ SV4 @ SV6 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[83]) ).
thf(86,plain,
! [SV3: $i,SV5: $i,SV1: $i] :
( ( ( cR @ SV1 @ SV5 )
= $false )
| ( ( cR @ SV1 @ SV3 )
= $false )
| ( ( ~ ( cR @ SV3 @ SV5 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[84]) ).
thf(87,plain,
! [SV4: $i,SV6: $i,SV2: $i] :
( ( ( cG @ SV2 @ SV6 )
= $false )
| ( ( cG @ SV2 @ SV4 )
= $false )
| ( ( ~ ( cG @ SV4 @ SV6 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[85]) ).
thf(88,plain,
! [SV1: $i,SV5: $i,SV3: $i] :
( ( ( cR @ SV3 @ SV5 )
= $false )
| ( ( cR @ SV1 @ SV3 )
= $false )
| ( ( cR @ SV1 @ SV5 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[86]) ).
thf(89,plain,
! [SV2: $i,SV6: $i,SV4: $i] :
( ( ( cG @ SV4 @ SV6 )
= $false )
| ( ( cG @ SV2 @ SV4 )
= $false )
| ( ( cG @ SV2 @ SV6 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[87]) ).
thf(90,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[54,89,88,68,67,66,65,64,63,62,61,60,59,58,57,56,55]) ).
thf(91,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO179^5 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 9 07:09:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 0
% 0.13/0.35
% 0.13/0.35 Length.of.Defs: 0
% 0.13/0.35
% 0.13/0.35 Contains.Choice.Funs: false
% 0.13/0.37 (rf:0,axioms:0,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.76/0.96
% 0.76/0.96 ********************************
% 0.76/0.96 * All subproblems solved! *
% 0.76/0.96 ********************************
% 0.76/0.96 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:15,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:90,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.76/0.96
% 0.76/0.96 %**** Beginning of derivation protocol ****
% 0.76/0.96 % SZS output start CNFRefutation
% See solution above
% 0.76/0.96
% 0.76/0.96 %**** End of derivation protocol ****
% 0.76/0.96 %**** no. of clauses in derivation: 91 ****
% 0.76/0.96 %**** clause counter: 90 ****
% 0.76/0.96
% 0.76/0.96 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:15,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:90,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------