TSTP Solution File: SYN722+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN722+1 : TPTP v8.1.0. Released v2.5.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 : Thu Jul 21 08:29:22 EDT 2022
% Result : Theorem 0.21s 0.38s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 25 unt; 8 typ; 0 def)
% Number of atoms : 331 ( 70 equ; 0 cnn)
% Maximal formula atoms : 10 ( 8 avg)
% Number of connectives : 493 ( 152 ~; 134 |; 18 &; 189 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 57 ( 0 ^ 53 !; 4 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_b,type,
b: $i ).
thf(tp_c,type,
c: $i ).
thf(tp_d,type,
d: $i ).
thf(tp_p,type,
p: $i > $o ).
thf(tp_q,type,
q: $i > $o ).
thf(tp_r,type,
r: $i > $o ).
thf(tp_sK1_Y,type,
sK1_Y: $i ).
thf(1,conjecture,
~ ( ! [Z: $i] :
( ( ( p @ Z )
| ( r @ Z ) )
& ( q @ Z ) )
& ! [X: $i] :
? [Y: $i] :
( ( p @ X )
| ~ ( q @ X )
| ~ ( q @ Y )
| ~ ( q @ c )
| ~ ( q @ d ) )
& ( ~ ( p @ a )
| ~ ( p @ b ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm119) ).
thf(2,negated_conjecture,
( ( ~ ( ! [Z: $i] :
( ( ( p @ Z )
| ( r @ Z ) )
& ( q @ Z ) )
& ! [X: $i] :
? [Y: $i] :
( ( p @ X )
| ~ ( q @ X )
| ~ ( q @ Y )
| ~ ( q @ c )
| ~ ( q @ d ) )
& ( ~ ( p @ a )
| ~ ( p @ b ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ~ ( ! [Z: $i] :
( ( ( p @ Z )
| ( r @ Z ) )
& ( q @ Z ) )
& ! [X: $i] :
? [Y: $i] :
( ( p @ X )
| ~ ( q @ X )
| ~ ( q @ Y )
| ~ ( q @ c )
| ~ ( q @ d ) )
& ( ~ ( p @ a )
| ~ ( p @ b ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [Z: $i] :
( ( ( p @ Z )
| ( r @ Z ) )
& ( q @ Z ) )
& ! [X: $i] :
? [Y: $i] :
( ( p @ X )
| ~ ( q @ X )
| ~ ( q @ Y )
| ~ ( q @ c )
| ~ ( q @ d ) )
& ( ~ ( p @ a )
| ~ ( p @ b ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Z: $i] : ( q @ Z )
& ! [Z: $i] :
( ( p @ Z )
| ( r @ Z ) )
& ( ! [X: $i] :
( ( p @ X )
| ~ ( q @ X ) )
| ~ ( q @ sK1_Y )
| ~ ( q @ c )
| ~ ( q @ d ) )
& ( ~ ( p @ a )
| ~ ( p @ b ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(6,plain,
( ( ! [Z: $i] : ( q @ Z )
& ! [Z: $i] :
( ( p @ Z )
| ( r @ Z ) )
& ( ! [X: $i] :
( ( p @ X )
| ~ ( q @ X ) )
| ~ ( q @ sK1_Y )
| ~ ( q @ c )
| ~ ( q @ d ) )
& ( ~ ( p @ a )
| ~ ( p @ b ) ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(7,plain,
( ( ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] : ( q @ SX0 )
| ~ ! [SX0: $i] :
( ( p @ SX0 )
| ( r @ SX0 ) ) )
| ~ ( ! [SX0: $i] :
( ( p @ SX0 )
| ~ ( q @ SX0 ) )
| ~ ( q @ sK1_Y )
| ~ ( q @ c )
| ~ ( q @ d ) ) )
| ~ ( ~ ( p @ a )
| ~ ( p @ b ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(8,plain,
( ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] : ( q @ SX0 )
| ~ ! [SX0: $i] :
( ( p @ SX0 )
| ( r @ SX0 ) ) )
| ~ ( ! [SX0: $i] :
( ( p @ SX0 )
| ~ ( q @ SX0 ) )
| ~ ( q @ sK1_Y )
| ~ ( q @ c )
| ~ ( q @ d ) ) )
| ~ ( ~ ( p @ a )
| ~ ( p @ b ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[7]) ).
thf(9,plain,
( ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] : ( q @ SX0 )
| ~ ! [SX0: $i] :
( ( p @ SX0 )
| ( r @ SX0 ) ) )
| ~ ( ! [SX0: $i] :
( ( p @ SX0 )
| ~ ( q @ SX0 ) )
| ~ ( q @ sK1_Y )
| ~ ( q @ c )
| ~ ( q @ d ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[8]) ).
thf(10,plain,
( ( ~ ( ~ ( p @ a )
| ~ ( p @ b ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[8]) ).
thf(11,plain,
( ( ~ ( ~ ~ ( ~ ! [SX0: $i] : ( q @ SX0 )
| ~ ! [SX0: $i] :
( ( p @ SX0 )
| ( r @ SX0 ) ) )
| ~ ( ! [SX0: $i] :
( ( p @ SX0 )
| ~ ( q @ SX0 ) )
| ~ ( q @ sK1_Y )
| ~ ( q @ c )
| ~ ( q @ d ) ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[9]) ).
thf(12,plain,
( ( ~ ( p @ a )
| ~ ( p @ b ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[10]) ).
thf(13,plain,
( ( ~ ~ ( ~ ! [SX0: $i] : ( q @ SX0 )
| ~ ! [SX0: $i] :
( ( p @ SX0 )
| ( r @ SX0 ) ) )
| ~ ( ! [SX0: $i] :
( ( p @ SX0 )
| ~ ( q @ SX0 ) )
| ~ ( q @ sK1_Y )
| ~ ( q @ c )
| ~ ( q @ d ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
( ( ( ~ ( p @ a ) )
= $true )
| ( ( ~ ( p @ b ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[12]) ).
thf(15,plain,
( ( ~ ~ ( ~ ! [SX0: $i] : ( q @ SX0 )
| ~ ! [SX0: $i] :
( ( p @ SX0 )
| ( r @ SX0 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ ( ! [SX0: $i] :
( ( p @ SX0 )
| ~ ( q @ SX0 ) )
| ~ ( q @ sK1_Y )
| ~ ( q @ c )
| ~ ( q @ d ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(17,plain,
( ( ( p @ a )
= $false )
| ( ( ~ ( p @ b ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[14]) ).
thf(18,plain,
( ( ~ ( ~ ! [SX0: $i] : ( q @ SX0 )
| ~ ! [SX0: $i] :
( ( p @ SX0 )
| ( r @ SX0 ) ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[15]) ).
thf(19,plain,
( ( ! [SX0: $i] :
( ( p @ SX0 )
| ~ ( q @ SX0 ) )
| ~ ( q @ sK1_Y )
| ~ ( q @ c )
| ~ ( q @ d ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(20,plain,
( ( ( p @ b )
= $false )
| ( ( p @ a )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(21,plain,
( ( ~ ! [SX0: $i] : ( q @ SX0 )
| ~ ! [SX0: $i] :
( ( p @ SX0 )
| ( r @ SX0 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(22,plain,
( ( ( ! [SX0: $i] :
( ( p @ SX0 )
| ~ ( q @ SX0 ) )
| ~ ( q @ sK1_Y )
| ~ ( q @ c ) )
= $true )
| ( ( ~ ( q @ d ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[19]) ).
thf(23,plain,
( ( ~ ! [SX0: $i] : ( q @ SX0 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[21]) ).
thf(24,plain,
( ( ~ ! [SX0: $i] :
( ( p @ SX0 )
| ( r @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[21]) ).
thf(25,plain,
( ( ( ! [SX0: $i] :
( ( p @ SX0 )
| ~ ( q @ SX0 ) )
| ~ ( q @ sK1_Y ) )
= $true )
| ( ( ~ ( q @ c ) )
= $true )
| ( ( ~ ( q @ d ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[22]) ).
thf(26,plain,
( ( ! [SX0: $i] : ( q @ SX0 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[23]) ).
thf(27,plain,
( ( ! [SX0: $i] :
( ( p @ SX0 )
| ( r @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[24]) ).
thf(28,plain,
( ( ( ! [SX0: $i] :
( ( p @ SX0 )
| ~ ( q @ SX0 ) ) )
= $true )
| ( ( ~ ( q @ sK1_Y ) )
= $true )
| ( ( ~ ( q @ c ) )
= $true )
| ( ( ~ ( q @ d ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[25]) ).
thf(29,plain,
! [SV1: $i] :
( ( q @ SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[26]) ).
thf(30,plain,
! [SV2: $i] :
( ( ( p @ SV2 )
| ( r @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[27]) ).
thf(31,plain,
! [SV3: $i] :
( ( ( ( p @ SV3 )
| ~ ( q @ SV3 ) )
= $true )
| ( ( ~ ( q @ sK1_Y ) )
= $true )
| ( ( ~ ( q @ c ) )
= $true )
| ( ( ~ ( q @ d ) )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(32,plain,
! [SV2: $i] :
( ( ( p @ SV2 )
= $true )
| ( ( r @ SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[30]) ).
thf(33,plain,
! [SV3: $i] :
( ( ( p @ SV3 )
= $true )
| ( ( ~ ( q @ SV3 ) )
= $true )
| ( ( ~ ( q @ sK1_Y ) )
= $true )
| ( ( ~ ( q @ c ) )
= $true )
| ( ( ~ ( q @ d ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[31]) ).
thf(34,plain,
! [SV3: $i] :
( ( ( q @ SV3 )
= $false )
| ( ( p @ SV3 )
= $true )
| ( ( ~ ( q @ sK1_Y ) )
= $true )
| ( ( ~ ( q @ c ) )
= $true )
| ( ( ~ ( q @ d ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[33]) ).
thf(35,plain,
! [SV3: $i] :
( ( ( q @ sK1_Y )
= $false )
| ( ( p @ SV3 )
= $true )
| ( ( q @ SV3 )
= $false )
| ( ( ~ ( q @ c ) )
= $true )
| ( ( ~ ( q @ d ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[34]) ).
thf(36,plain,
! [SV3: $i] :
( ( ( q @ c )
= $false )
| ( ( q @ SV3 )
= $false )
| ( ( p @ SV3 )
= $true )
| ( ( q @ sK1_Y )
= $false )
| ( ( ~ ( q @ d ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[35]) ).
thf(37,plain,
! [SV3: $i] :
( ( ( q @ d )
= $false )
| ( ( q @ sK1_Y )
= $false )
| ( ( p @ SV3 )
= $true )
| ( ( q @ SV3 )
= $false )
| ( ( q @ c )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[36]) ).
thf(38,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[20,37,32,29]) ).
thf(39,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN722+1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 14:44:54 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35
% 0.14/0.35 No.of.Axioms: 0
% 0.14/0.35
% 0.14/0.35 Length.of.Defs: 0
% 0.14/0.35
% 0.14/0.35 Contains.Choice.Funs: false
% 0.14/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:600,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.21/0.38
% 0.21/0.38 ********************************
% 0.21/0.38 * All subproblems solved! *
% 0.21/0.38 ********************************
% 0.21/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:38,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.21/0.38
% 0.21/0.38 %**** Beginning of derivation protocol ****
% 0.21/0.38 % SZS output start CNFRefutation
% See solution above
% 0.21/0.38
% 0.21/0.38 %**** End of derivation protocol ****
% 0.21/0.38 %**** no. of clauses in derivation: 39 ****
% 0.21/0.38 %**** clause counter: 38 ****
% 0.21/0.38
% 0.21/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:38,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------