TSTP Solution File: SEV310^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEV310^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 : n023.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 : Tue Jul 19 17:36:08 EDT 2022
% Result : Theorem 0.54s 0.75s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 48 ( 22 unt; 5 typ; 0 def)
% Number of atoms : 216 ( 65 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 556 ( 98 ~; 74 |; 6 &; 334 @)
% ( 0 <=>; 44 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 84 ( 84 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 135 ( 12 ^ 123 !; 0 ?; 135 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $tType ).
thf(tp_cK,type,
cK: ( a > $o ) > a > $o ).
thf(tp_sK1_Xx,type,
sK1_Xx: a ).
thf(tp_sK2_Xx0,type,
sK2_Xx0: ( a > $o ) > a ).
thf(tp_sK3_Xx,type,
sK3_Xx: ( a > $o ) > ( a > $o ) > a ).
thf(1,conjecture,
( ! [X: a > $o,Y: a > $o] :
( ! [Xx: a] :
( ( X @ Xx )
=> ( Y @ Xx ) )
=> ! [Xx: a] :
( ( cK @ X @ Xx )
=> ( cK @ Y @ Xx ) ) )
=> ! [Xx: a] :
( ! [S: a > $o] :
( ! [Xx0: a] :
( ( cK @ S @ Xx0 )
=> ( S @ Xx0 ) )
=> ( S @ Xx ) )
=> ( cK
@ ^ [Xx0: a] :
! [S: a > $o] :
( ! [Xx1: a] :
( ( cK @ S @ Xx1 )
=> ( S @ Xx1 ) )
=> ( S @ Xx0 ) )
@ Xx ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM90A_pme) ).
thf(2,negated_conjecture,
( ( ! [X: a > $o,Y: a > $o] :
( ! [Xx: a] :
( ( X @ Xx )
=> ( Y @ Xx ) )
=> ! [Xx: a] :
( ( cK @ X @ Xx )
=> ( cK @ Y @ Xx ) ) )
=> ! [Xx: a] :
( ! [S: a > $o] :
( ! [Xx0: a] :
( ( cK @ S @ Xx0 )
=> ( S @ Xx0 ) )
=> ( S @ Xx ) )
=> ( cK
@ ^ [Xx0: a] :
! [S: a > $o] :
( ! [Xx1: a] :
( ( cK @ S @ Xx1 )
=> ( S @ Xx1 ) )
=> ( S @ Xx0 ) )
@ Xx ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [X: a > $o,Y: a > $o] :
( ! [Xx: a] :
( ( X @ Xx )
=> ( Y @ Xx ) )
=> ! [Xx: a] :
( ( cK @ X @ Xx )
=> ( cK @ Y @ Xx ) ) )
=> ! [Xx: a] :
( ! [S: a > $o] :
( ! [Xx0: a] :
( ( cK @ S @ Xx0 )
=> ( S @ Xx0 ) )
=> ( S @ Xx ) )
=> ( cK
@ ^ [Xx0: a] :
! [S: a > $o] :
( ! [Xx1: a] :
( ( cK @ S @ Xx1 )
=> ( S @ Xx1 ) )
=> ( S @ Xx0 ) )
@ Xx ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [X: a > $o,Y: a > $o] :
( ! [Xx: a] :
( ( X @ Xx )
=> ( Y @ Xx ) )
=> ! [Xx: a] :
( ( cK @ X @ Xx )
=> ( cK @ Y @ Xx ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Xx: a] :
( ! [S: a > $o] :
( ! [Xx0: a] :
( ( cK @ S @ Xx0 )
=> ( S @ Xx0 ) )
=> ( S @ Xx ) )
=> ( cK
@ ^ [Xx0: a] :
! [S: a > $o] :
( ! [Xx1: a] :
( ( cK @ S @ Xx1 )
=> ( S @ Xx1 ) )
=> ( S @ Xx0 ) )
@ Xx ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ~ ! [Xx: a] :
( ! [S: a > $o] :
( ! [Xx0: a] :
( ( cK @ S @ Xx0 )
=> ( S @ Xx0 ) )
=> ( S @ Xx ) )
=> ( cK
@ ^ [Xx0: a] :
! [S: a > $o] :
( ! [Xx1: a] :
( ( cK @ S @ Xx1 )
=> ( S @ Xx1 ) )
=> ( S @ Xx0 ) )
@ Xx ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [SY10: a > $o] :
( ( ( cK @ SY10 @ ( sK2_Xx0 @ SY10 ) )
& ~ ( SY10 @ ( sK2_Xx0 @ SY10 ) ) )
| ( SY10 @ sK1_Xx ) )
& ~ ( cK
@ ^ [Xx0: a] :
! [S: a > $o] :
( ! [Xx1: a] :
( ( cK @ S @ Xx1 )
=> ( S @ Xx1 ) )
=> ( S @ Xx0 ) )
@ sK1_Xx ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [X: a > $o,Y: a > $o] :
( ( ( X @ ( sK3_Xx @ Y @ X ) )
& ~ ( Y @ ( sK3_Xx @ Y @ X ) ) )
| ! [Xx: a] :
( ~ ( cK @ X @ Xx )
| ( cK @ Y @ Xx ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(9,plain,
( ( ! [X: a > $o,Y: a > $o] :
( ( ( X @ ( sK3_Xx @ Y @ X ) )
& ~ ( Y @ ( sK3_Xx @ Y @ X ) ) )
| ! [Xx: a] :
( ~ ( cK @ X @ Xx )
| ( cK @ Y @ Xx ) ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(10,plain,
( ( ! [SY10: a > $o] :
( ( ( cK @ SY10 @ ( sK2_Xx0 @ SY10 ) )
& ~ ( SY10 @ ( sK2_Xx0 @ SY10 ) ) )
| ( SY10 @ sK1_Xx ) )
& ~ ( cK
@ ^ [Xx0: a] :
! [S: a > $o] :
( ! [Xx1: a] :
( ( cK @ S @ Xx1 )
=> ( S @ Xx1 ) )
=> ( S @ Xx0 ) )
@ sK1_Xx ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
( ( ! [SX0: a > $o,SX1: a > $o] :
( ~ ( ~ ( SX0 @ ( sK3_Xx @ SX1 @ SX0 ) )
| ~ ~ ( SX1 @ ( sK3_Xx @ SX1 @ SX0 ) ) )
| ! [SX2: a] :
( ~ ( cK @ SX0 @ SX2 )
| ( cK @ SX1 @ SX2 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(12,plain,
( ( ~ ( ~ ! [SX0: a > $o] :
( ~ ( ~ ( cK @ SX0 @ ( sK2_Xx0 @ SX0 ) )
| ~ ~ ( SX0 @ ( sK2_Xx0 @ SX0 ) ) )
| ( SX0 @ sK1_Xx ) )
| ~ ~ ( cK
@ ^ [SX0: a] :
! [SX1: a > $o] :
( ~ ! [SX2: a] :
( ~ ( cK @ SX1 @ SX2 )
| ( SX1 @ SX2 ) )
| ( SX1 @ SX0 ) )
@ sK1_Xx ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(13,plain,
! [SV1: a > $o] :
( ( ! [SY15: a > $o] :
( ~ ( ~ ( SV1 @ ( sK3_Xx @ SY15 @ SV1 ) )
| ~ ~ ( SY15 @ ( sK3_Xx @ SY15 @ SV1 ) ) )
| ! [SY16: a] :
( ~ ( cK @ SV1 @ SY16 )
| ( cK @ SY15 @ SY16 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(14,plain,
( ( ~ ! [SX0: a > $o] :
( ~ ( ~ ( cK @ SX0 @ ( sK2_Xx0 @ SX0 ) )
| ~ ~ ( SX0 @ ( sK2_Xx0 @ SX0 ) ) )
| ( SX0 @ sK1_Xx ) )
| ~ ~ ( cK
@ ^ [SX0: a] :
! [SX1: a > $o] :
( ~ ! [SX2: a] :
( ~ ( cK @ SX1 @ SX2 )
| ( SX1 @ SX2 ) )
| ( SX1 @ SX0 ) )
@ sK1_Xx ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(15,plain,
! [SV2: a > $o,SV1: a > $o] :
( ( ~ ( ~ ( SV1 @ ( sK3_Xx @ SV2 @ SV1 ) )
| ~ ~ ( SV2 @ ( sK3_Xx @ SV2 @ SV1 ) ) )
| ! [SY17: a] :
( ~ ( cK @ SV1 @ SY17 )
| ( cK @ SV2 @ SY17 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ ! [SX0: a > $o] :
( ~ ( ~ ( cK @ SX0 @ ( sK2_Xx0 @ SX0 ) )
| ~ ~ ( SX0 @ ( sK2_Xx0 @ SX0 ) ) )
| ( SX0 @ sK1_Xx ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(17,plain,
( ( ~ ~ ( cK
@ ^ [SX0: a] :
! [SX1: a > $o] :
( ~ ! [SX2: a] :
( ~ ( cK @ SX1 @ SX2 )
| ( SX1 @ SX2 ) )
| ( SX1 @ SX0 ) )
@ sK1_Xx ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(18,plain,
! [SV2: a > $o,SV1: a > $o] :
( ( ( ~ ( ~ ( SV1 @ ( sK3_Xx @ SV2 @ SV1 ) )
| ~ ~ ( SV2 @ ( sK3_Xx @ SV2 @ SV1 ) ) ) )
= $true )
| ( ( ! [SY17: a] :
( ~ ( cK @ SV1 @ SY17 )
| ( cK @ SV2 @ SY17 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[15]) ).
thf(19,plain,
( ( ! [SX0: a > $o] :
( ~ ( ~ ( cK @ SX0 @ ( sK2_Xx0 @ SX0 ) )
| ~ ~ ( SX0 @ ( sK2_Xx0 @ SX0 ) ) )
| ( SX0 @ sK1_Xx ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(20,plain,
( ( ~ ( cK
@ ^ [SX0: a] :
! [SX1: a > $o] :
( ~ ! [SX2: a] :
( ~ ( cK @ SX1 @ SX2 )
| ( SX1 @ SX2 ) )
| ( SX1 @ SX0 ) )
@ sK1_Xx ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[17]) ).
thf(21,plain,
! [SV2: a > $o,SV1: a > $o] :
( ( ( ~ ( SV1 @ ( sK3_Xx @ SV2 @ SV1 ) )
| ~ ~ ( SV2 @ ( sK3_Xx @ SV2 @ SV1 ) ) )
= $false )
| ( ( ! [SY17: a] :
( ~ ( cK @ SV1 @ SY17 )
| ( cK @ SV2 @ SY17 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(22,plain,
! [SV3: a > $o] :
( ( ~ ( ~ ( cK @ SV3 @ ( sK2_Xx0 @ SV3 ) )
| ~ ~ ( SV3 @ ( sK2_Xx0 @ SV3 ) ) )
| ( SV3 @ sK1_Xx ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(23,plain,
( ( cK
@ ^ [SX0: a] :
! [SX1: a > $o] :
( ~ ! [SX2: a] :
( ~ ( cK @ SX1 @ SX2 )
| ( SX1 @ SX2 ) )
| ( SX1 @ SX0 ) )
@ sK1_Xx )
= $false ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(24,plain,
! [SV2: a > $o,SV1: a > $o] :
( ( ( ~ ( SV1 @ ( sK3_Xx @ SV2 @ SV1 ) ) )
= $false )
| ( ( ! [SY17: a] :
( ~ ( cK @ SV1 @ SY17 )
| ( cK @ SV2 @ SY17 ) ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[21]) ).
thf(25,plain,
! [SV1: a > $o,SV2: a > $o] :
( ( ( ~ ~ ( SV2 @ ( sK3_Xx @ SV2 @ SV1 ) ) )
= $false )
| ( ( ! [SY17: a] :
( ~ ( cK @ SV1 @ SY17 )
| ( cK @ SV2 @ SY17 ) ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[21]) ).
thf(26,plain,
! [SV3: a > $o] :
( ( ( ~ ( ~ ( cK @ SV3 @ ( sK2_Xx0 @ SV3 ) )
| ~ ~ ( SV3 @ ( sK2_Xx0 @ SV3 ) ) ) )
= $true )
| ( ( SV3 @ sK1_Xx )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[22]) ).
thf(27,plain,
! [SV2: a > $o,SV1: a > $o] :
( ( ( SV1 @ ( sK3_Xx @ SV2 @ SV1 ) )
= $true )
| ( ( ! [SY17: a] :
( ~ ( cK @ SV1 @ SY17 )
| ( cK @ SV2 @ SY17 ) ) )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[24]) ).
thf(28,plain,
! [SV1: a > $o,SV2: a > $o] :
( ( ( ~ ( SV2 @ ( sK3_Xx @ SV2 @ SV1 ) ) )
= $true )
| ( ( ! [SY17: a] :
( ~ ( cK @ SV1 @ SY17 )
| ( cK @ SV2 @ SY17 ) ) )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[25]) ).
thf(29,plain,
! [SV3: a > $o] :
( ( ( ~ ( cK @ SV3 @ ( sK2_Xx0 @ SV3 ) )
| ~ ~ ( SV3 @ ( sK2_Xx0 @ SV3 ) ) )
= $false )
| ( ( SV3 @ sK1_Xx )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(30,plain,
! [SV2: a > $o,SV4: a,SV1: a > $o] :
( ( ( ~ ( cK @ SV1 @ SV4 )
| ( cK @ SV2 @ SV4 ) )
= $true )
| ( ( SV1 @ ( sK3_Xx @ SV2 @ SV1 ) )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[27]) ).
thf(31,plain,
! [SV1: a > $o,SV2: a > $o] :
( ( ( SV2 @ ( sK3_Xx @ SV2 @ SV1 ) )
= $false )
| ( ( ! [SY17: a] :
( ~ ( cK @ SV1 @ SY17 )
| ( cK @ SV2 @ SY17 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[28]) ).
thf(32,plain,
! [SV3: a > $o] :
( ( ( ~ ( cK @ SV3 @ ( sK2_Xx0 @ SV3 ) ) )
= $false )
| ( ( SV3 @ sK1_Xx )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[29]) ).
thf(33,plain,
! [SV3: a > $o] :
( ( ( ~ ~ ( SV3 @ ( sK2_Xx0 @ SV3 ) ) )
= $false )
| ( ( SV3 @ sK1_Xx )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[29]) ).
thf(34,plain,
! [SV2: a > $o,SV4: a,SV1: a > $o] :
( ( ( ~ ( cK @ SV1 @ SV4 ) )
= $true )
| ( ( cK @ SV2 @ SV4 )
= $true )
| ( ( SV1 @ ( sK3_Xx @ SV2 @ SV1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[30]) ).
thf(35,plain,
! [SV2: a > $o,SV5: a,SV1: a > $o] :
( ( ( ~ ( cK @ SV1 @ SV5 )
| ( cK @ SV2 @ SV5 ) )
= $true )
| ( ( SV2 @ ( sK3_Xx @ SV2 @ SV1 ) )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(36,plain,
! [SV3: a > $o] :
( ( ( cK @ SV3 @ ( sK2_Xx0 @ SV3 ) )
= $true )
| ( ( SV3 @ sK1_Xx )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[32]) ).
thf(37,plain,
! [SV3: a > $o] :
( ( ( ~ ( SV3 @ ( sK2_Xx0 @ SV3 ) ) )
= $true )
| ( ( SV3 @ sK1_Xx )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[33]) ).
thf(38,plain,
! [SV2: a > $o,SV4: a,SV1: a > $o] :
( ( ( cK @ SV1 @ SV4 )
= $false )
| ( ( cK @ SV2 @ SV4 )
= $true )
| ( ( SV1 @ ( sK3_Xx @ SV2 @ SV1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[34]) ).
thf(39,plain,
! [SV2: a > $o,SV5: a,SV1: a > $o] :
( ( ( ~ ( cK @ SV1 @ SV5 ) )
= $true )
| ( ( cK @ SV2 @ SV5 )
= $true )
| ( ( SV2 @ ( sK3_Xx @ SV2 @ SV1 ) )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[35]) ).
thf(40,plain,
! [SV3: a > $o] :
( ( ( SV3 @ ( sK2_Xx0 @ SV3 ) )
= $false )
| ( ( SV3 @ sK1_Xx )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[37]) ).
thf(41,plain,
! [SV2: a > $o,SV5: a,SV1: a > $o] :
( ( ( cK @ SV1 @ SV5 )
= $false )
| ( ( cK @ SV2 @ SV5 )
= $true )
| ( ( SV2 @ ( sK3_Xx @ SV2 @ SV1 ) )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(42,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[23,41,40,38,36]) ).
thf(43,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV310^5 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 28 18:02:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 0
% 0.13/0.34
% 0.13/0.34 Length.of.Defs: 0
% 0.13/0.34
% 0.13/0.34 Contains.Choice.Funs: false
% 0.13/0.35 (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.54/0.75
% 0.54/0.75 ********************************
% 0.54/0.75 * All subproblems solved! *
% 0.54/0.75 ********************************
% 0.54/0.75 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,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:42,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.54/0.75
% 0.54/0.75 %**** Beginning of derivation protocol ****
% 0.54/0.75 % SZS output start CNFRefutation
% See solution above
% 0.54/0.75
% 0.54/0.75 %**** End of derivation protocol ****
% 0.54/0.75 %**** no. of clauses in derivation: 43 ****
% 0.54/0.75 %**** clause counter: 42 ****
% 0.54/0.75
% 0.54/0.75 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,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:42,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------