TSTP Solution File: SYN055+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN055+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n013.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 08:23:03 EDT 2022
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 78 ( 43 unt; 8 typ; 0 def)
% Number of atoms : 363 ( 89 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 385 ( 110 ~; 89 |; 18 &; 160 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 67 ( 0 ^ 59 !; 8 ?; 67 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_big_f,type,
big_f: $i > $o ).
thf(tp_big_g,type,
big_g: $i > $o ).
thf(tp_big_p,type,
big_p: $i > $o ).
thf(tp_big_q,type,
big_q: $i > $o ).
thf(tp_big_r,type,
big_r: $i > $o ).
thf(tp_sK1_Z,type,
sK1_Z: $i ).
thf(tp_sK2_REN,type,
sK2_REN: $o ).
thf(tp_sK3_X,type,
sK3_X: $i ).
thf(1,axiom,
( ! [X: $i] :
( ( big_p @ X )
=> ( big_q @ X ) )
| ? [Z: $i] :
( ( big_p @ Z )
& ( big_r @ Z ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel25_4) ).
thf(2,axiom,
! [X: $i] :
( ( big_p @ X )
=> ( ( big_g @ X )
& ( big_f @ X ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel25_3) ).
thf(3,axiom,
! [X: $i] :
( ( big_f @ X )
=> ( ~ ( big_g @ X )
& ( big_r @ X ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel25_2) ).
thf(4,axiom,
? [X: $i] : ( big_p @ X ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel25_1) ).
thf(5,conjecture,
? [X: $i] :
( ( big_q @ X )
& ( big_p @ X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel25) ).
thf(6,negated_conjecture,
( ( ? [X: $i] :
( ( big_q @ X )
& ( big_p @ X ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[5]) ).
thf(7,plain,
( ( ? [X: $i] :
( ( big_q @ X )
& ( big_p @ X ) ) )
= $false ),
inference(unfold_def,[status(thm)],[6]) ).
thf(8,plain,
( ( ! [X: $i] :
( ( big_p @ X )
=> ( big_q @ X ) )
| ? [Z: $i] :
( ( big_p @ Z )
& ( big_r @ Z ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(9,plain,
( ( ! [X: $i] :
( ( big_p @ X )
=> ( ( big_g @ X )
& ( big_f @ X ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(10,plain,
( ( ! [X: $i] :
( ( big_f @ X )
=> ( ~ ( big_g @ X )
& ( big_r @ X ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(11,plain,
( ( ? [X: $i] : ( big_p @ X ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(12,plain,
( ( ~ ? [X: $i] :
( ( big_q @ X )
& ( big_p @ X ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(13,plain,
( ( ! [X: $i] :
( ~ ( big_p @ X )
| ~ ( big_q @ X ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[12]) ).
thf(14,plain,
( ( ( ! [X: $i] :
( ~ ( big_p @ X )
| ( big_q @ X ) )
| sK2_REN )
& ( sK2_REN
=> ( ( big_p @ sK1_Z )
& ( big_r @ sK1_Z ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[8]) ).
thf(15,plain,
( ( ! [X: $i] :
( ~ ( big_p @ X )
| ( big_f @ X ) )
& ! [X: $i] :
( ~ ( big_p @ X )
| ( big_g @ X ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(16,plain,
( ( ! [X: $i] :
( ~ ( big_f @ X )
| ~ ( big_g @ X ) )
& ! [X: $i] :
( ~ ( big_f @ X )
| ( big_r @ X ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[10]) ).
thf(17,plain,
( ( big_p @ sK3_X )
= $true ),
inference(extcnf_combined,[status(esa)],[11]) ).
thf(18,plain,
( ( big_p @ sK3_X )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(19,plain,
( ( ! [X: $i] :
( ~ ( big_f @ X )
| ~ ( big_g @ X ) )
& ! [X: $i] :
( ~ ( big_f @ X )
| ( big_r @ X ) ) )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(20,plain,
( ( ! [X: $i] :
( ~ ( big_p @ X )
| ( big_f @ X ) )
& ! [X: $i] :
( ~ ( big_p @ X )
| ( big_g @ X ) ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(21,plain,
( ( ( ! [X: $i] :
( ~ ( big_p @ X )
| ( big_q @ X ) )
| sK2_REN )
& ( sK2_REN
=> ( ( big_p @ sK1_Z )
& ( big_r @ sK1_Z ) ) ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(22,plain,
( ( ! [X: $i] :
( ~ ( big_p @ X )
| ~ ( big_q @ X ) ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(23,plain,
( ( ~ ( ~ ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_f @ SX0 ) )
| ~ ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_g @ SX0 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[20]) ).
thf(24,plain,
( ( ~ ( ~ ( ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_q @ SX0 ) )
| sK2_REN )
| ~ ( ~ sK2_REN
| ~ ( ~ ( big_p @ sK1_Z )
| ~ ( big_r @ sK1_Z ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[21]) ).
thf(25,plain,
( ( ~ ( ~ ! [SX0: $i] :
( ~ ( big_f @ SX0 )
| ~ ( big_g @ SX0 ) )
| ~ ! [SX0: $i] :
( ~ ( big_f @ SX0 )
| ( big_r @ SX0 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[19]) ).
thf(26,plain,
! [SV1: $i] :
( ( ~ ( big_p @ SV1 )
| ~ ( big_q @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(27,plain,
( ( ~ ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_f @ SX0 ) )
| ~ ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_g @ SX0 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(28,plain,
( ( ~ ( ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_q @ SX0 ) )
| sK2_REN )
| ~ ( ~ sK2_REN
| ~ ( ~ ( big_p @ sK1_Z )
| ~ ( big_r @ sK1_Z ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(29,plain,
( ( ~ ! [SX0: $i] :
( ~ ( big_f @ SX0 )
| ~ ( big_g @ SX0 ) )
| ~ ! [SX0: $i] :
( ~ ( big_f @ SX0 )
| ( big_r @ SX0 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(30,plain,
! [SV1: $i] :
( ( ( ~ ( big_p @ SV1 ) )
= $true )
| ( ( ~ ( big_q @ SV1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[26]) ).
thf(31,plain,
( ( ~ ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_f @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[27]) ).
thf(32,plain,
( ( ~ ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_g @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[27]) ).
thf(33,plain,
( ( ~ ( ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_q @ SX0 ) )
| sK2_REN ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[28]) ).
thf(34,plain,
( ( ~ ( ~ sK2_REN
| ~ ( ~ ( big_p @ sK1_Z )
| ~ ( big_r @ sK1_Z ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[28]) ).
thf(35,plain,
( ( ~ ! [SX0: $i] :
( ~ ( big_f @ SX0 )
| ~ ( big_g @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[29]) ).
thf(36,plain,
( ( ~ ! [SX0: $i] :
( ~ ( big_f @ SX0 )
| ( big_r @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[29]) ).
thf(37,plain,
! [SV1: $i] :
( ( ( big_p @ SV1 )
= $false )
| ( ( ~ ( big_q @ SV1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[30]) ).
thf(38,plain,
( ( ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_f @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[31]) ).
thf(39,plain,
( ( ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_g @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[32]) ).
thf(40,plain,
( ( ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_q @ SX0 ) )
| sK2_REN )
= $true ),
inference(extcnf_not_neg,[status(thm)],[33]) ).
thf(41,plain,
( ( ~ sK2_REN
| ~ ( ~ ( big_p @ sK1_Z )
| ~ ( big_r @ sK1_Z ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[34]) ).
thf(42,plain,
( ( ! [SX0: $i] :
( ~ ( big_f @ SX0 )
| ~ ( big_g @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[35]) ).
thf(43,plain,
( ( ! [SX0: $i] :
( ~ ( big_f @ SX0 )
| ( big_r @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[36]) ).
thf(44,plain,
! [SV1: $i] :
( ( ( big_q @ SV1 )
= $false )
| ( ( big_p @ SV1 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[37]) ).
thf(45,plain,
! [SV2: $i] :
( ( ~ ( big_p @ SV2 )
| ( big_f @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[38]) ).
thf(46,plain,
! [SV3: $i] :
( ( ~ ( big_p @ SV3 )
| ( big_g @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[39]) ).
thf(47,plain,
( ( ( ! [SX0: $i] :
( ~ ( big_p @ SX0 )
| ( big_q @ SX0 ) ) )
= $true )
| ( sK2_REN = $true ) ),
inference(extcnf_or_pos,[status(thm)],[40]) ).
thf(48,plain,
( ( ( ~ sK2_REN )
= $true )
| ( ( ~ ( ~ ( big_p @ sK1_Z )
| ~ ( big_r @ sK1_Z ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[41]) ).
thf(49,plain,
! [SV4: $i] :
( ( ~ ( big_f @ SV4 )
| ~ ( big_g @ SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[42]) ).
thf(50,plain,
! [SV5: $i] :
( ( ~ ( big_f @ SV5 )
| ( big_r @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[43]) ).
thf(51,plain,
! [SV2: $i] :
( ( ( ~ ( big_p @ SV2 ) )
= $true )
| ( ( big_f @ SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[45]) ).
thf(52,plain,
! [SV3: $i] :
( ( ( ~ ( big_p @ SV3 ) )
= $true )
| ( ( big_g @ SV3 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[46]) ).
thf(53,plain,
! [SV6: $i] :
( ( ( ~ ( big_p @ SV6 )
| ( big_q @ SV6 ) )
= $true )
| ( sK2_REN = $true ) ),
inference(extcnf_forall_pos,[status(thm)],[47]) ).
thf(54,plain,
( ( sK2_REN = $false )
| ( ( ~ ( ~ ( big_p @ sK1_Z )
| ~ ( big_r @ sK1_Z ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[48]) ).
thf(55,plain,
! [SV4: $i] :
( ( ( ~ ( big_f @ SV4 ) )
= $true )
| ( ( ~ ( big_g @ SV4 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[49]) ).
thf(56,plain,
! [SV5: $i] :
( ( ( ~ ( big_f @ SV5 ) )
= $true )
| ( ( big_r @ SV5 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[50]) ).
thf(57,plain,
! [SV2: $i] :
( ( ( big_p @ SV2 )
= $false )
| ( ( big_f @ SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[51]) ).
thf(58,plain,
! [SV3: $i] :
( ( ( big_p @ SV3 )
= $false )
| ( ( big_g @ SV3 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[52]) ).
thf(59,plain,
! [SV6: $i] :
( ( ( ~ ( big_p @ SV6 ) )
= $true )
| ( ( big_q @ SV6 )
= $true )
| ( sK2_REN = $true ) ),
inference(extcnf_or_pos,[status(thm)],[53]) ).
thf(60,plain,
( ( ( ~ ( big_p @ sK1_Z )
| ~ ( big_r @ sK1_Z ) )
= $false )
| ( sK2_REN = $false ) ),
inference(extcnf_not_pos,[status(thm)],[54]) ).
thf(61,plain,
! [SV4: $i] :
( ( ( big_f @ SV4 )
= $false )
| ( ( ~ ( big_g @ SV4 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[55]) ).
thf(62,plain,
! [SV5: $i] :
( ( ( big_f @ SV5 )
= $false )
| ( ( big_r @ SV5 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[56]) ).
thf(63,plain,
! [SV6: $i] :
( ( ( big_p @ SV6 )
= $false )
| ( ( big_q @ SV6 )
= $true )
| ( sK2_REN = $true ) ),
inference(extcnf_not_pos,[status(thm)],[59]) ).
thf(64,plain,
( ( ( ~ ( big_p @ sK1_Z ) )
= $false )
| ( sK2_REN = $false ) ),
inference(extcnf_or_neg,[status(thm)],[60]) ).
thf(65,plain,
( ( ( ~ ( big_r @ sK1_Z ) )
= $false )
| ( sK2_REN = $false ) ),
inference(extcnf_or_neg,[status(thm)],[60]) ).
thf(66,plain,
! [SV4: $i] :
( ( ( big_g @ SV4 )
= $false )
| ( ( big_f @ SV4 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[61]) ).
thf(67,plain,
( ( ( big_p @ sK1_Z )
= $true )
| ( sK2_REN = $false ) ),
inference(extcnf_not_neg,[status(thm)],[64]) ).
thf(68,plain,
( ( ( big_r @ sK1_Z )
= $true )
| ( sK2_REN = $false ) ),
inference(extcnf_not_neg,[status(thm)],[65]) ).
thf(69,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[18,68,67,66,63,62,58,57,44]) ).
thf(70,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN055+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n013.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 Jul 12 03:28:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 4
% 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.34 (rf:0,axioms:4,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:6,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.13/0.38
% 0.13/0.38 ********************************
% 0.13/0.38 * All subproblems solved! *
% 0.13/0.38 ********************************
% 0.13/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:4,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:69,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.38
% 0.13/0.38 %**** Beginning of derivation protocol ****
% 0.13/0.38 % SZS output start CNFRefutation
% See solution above
% 0.13/0.38
% 0.13/0.38 %**** End of derivation protocol ****
% 0.13/0.38 %**** no. of clauses in derivation: 70 ****
% 0.13/0.38 %**** clause counter: 69 ****
% 0.13/0.38
% 0.13/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:4,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:69,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------