TSTP Solution File: SYN728+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN728+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 : n005.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:25 EDT 2022
% Result : Theorem 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 25 unt; 8 typ; 0 def)
% Number of atoms : 214 ( 52 equ; 0 cnn)
% Maximal formula atoms : 9 ( 5 avg)
% Number of connectives : 349 ( 38 ~; 42 |; 17 &; 241 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 0 ^ 65 !; 13 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_f,type,
f: $i > $i > $i ).
thf(tp_g,type,
g: $i > $i ).
thf(tp_m,type,
m: $i > $o ).
thf(tp_p,type,
p: $i > $i > $o ).
thf(tp_q,type,
q: $i > $o ).
thf(tp_sK1_U,type,
sK1_U: $i ).
thf(tp_sK2_U,type,
sK2_U: $i ).
thf(tp_sK3_S,type,
sK3_S: $i > $i ).
thf(1,conjecture,
( ( ! [X: $i] :
( ? [Y: $i] : ( p @ X @ Y )
=> ! [Z: $i] : ( p @ Z @ Z ) )
& ! [R: $i] :
? [S: $i] :
( ( p @ R @ S )
| ( ( m @ R )
& ( q @ ( f @ R @ S ) ) ) )
& ! [W: $i] :
( ( q @ W )
=> ~ ( m @ ( g @ W ) ) ) )
=> ! [U: $i] :
? [V: $i] :
( ( p @ ( g @ U ) @ V )
& ( p @ U @ U ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm69) ).
thf(2,negated_conjecture,
( ( ( ! [X: $i] :
( ? [Y: $i] : ( p @ X @ Y )
=> ! [Z: $i] : ( p @ Z @ Z ) )
& ! [R: $i] :
? [S: $i] :
( ( p @ R @ S )
| ( ( m @ R )
& ( q @ ( f @ R @ S ) ) ) )
& ! [W: $i] :
( ( q @ W )
=> ~ ( m @ ( g @ W ) ) ) )
=> ! [U: $i] :
? [V: $i] :
( ( p @ ( g @ U ) @ V )
& ( p @ U @ U ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ! [X: $i] :
( ? [Y: $i] : ( p @ X @ Y )
=> ! [Z: $i] : ( p @ Z @ Z ) )
& ! [R: $i] :
? [S: $i] :
( ( p @ R @ S )
| ( ( m @ R )
& ( q @ ( f @ R @ S ) ) ) )
& ! [W: $i] :
( ( q @ W )
=> ~ ( m @ ( g @ W ) ) ) )
=> ! [U: $i] :
? [V: $i] :
( ( p @ ( g @ U ) @ V )
& ( p @ U @ U ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [X: $i] :
( ? [Y: $i] : ( p @ X @ Y )
=> ! [Z: $i] : ( p @ Z @ Z ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [R: $i] :
? [S: $i] :
( ( p @ R @ S )
| ( ( m @ R )
& ( q @ ( f @ R @ S ) ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ! [W: $i] :
( ( q @ W )
=> ~ ( m @ ( g @ W ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ! [U: $i] :
? [V: $i] :
( ( p @ ( g @ U ) @ V )
& ( p @ U @ U ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(8,plain,
( ( ~ ! [U: $i] :
? [V: $i] :
( ( p @ ( g @ U ) @ V )
& ( p @ U @ U ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(9,plain,
( ( ! [SY8: $i] :
~ ( p @ ( g @ sK2_U ) @ SY8 )
| ~ ( p @ sK1_U @ sK1_U ) )
= $true ),
inference(extcnf_combined,[status(esa)],[8]) ).
thf(10,plain,
( ( ! [X: $i,Y: $i] :
~ ( p @ X @ Y )
| ! [Z: $i] : ( p @ Z @ Z ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(11,plain,
( ( ! [R: $i] :
( ( ( m @ R )
| ( p @ R @ ( sK3_S @ R ) ) )
& ( ( q @ ( f @ R @ ( sK3_S @ R ) ) )
| ( p @ R @ ( sK3_S @ R ) ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[5]) ).
thf(12,plain,
( ( ! [W: $i] :
( ~ ( q @ W )
| ~ ( m @ ( g @ W ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(13,plain,
( ( ! [W: $i] :
( ~ ( q @ W )
| ~ ( m @ ( g @ W ) ) ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(14,plain,
( ( ! [R: $i] :
( ( ( m @ R )
| ( p @ R @ ( sK3_S @ R ) ) )
& ( ( q @ ( f @ R @ ( sK3_S @ R ) ) )
| ( p @ R @ ( sK3_S @ R ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(15,plain,
( ( ! [X: $i,Y: $i] :
~ ( p @ X @ Y )
| ! [Z: $i] : ( p @ Z @ Z ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(16,plain,
( ( ! [SY8: $i] :
~ ( p @ ( g @ sK2_U ) @ SY8 )
| ~ ( p @ sK1_U @ sK1_U ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(17,plain,
( ( ! [SX0: $i] :
~ ( ~ ( ( m @ SX0 )
| ( p @ SX0 @ ( sK3_S @ SX0 ) ) )
| ~ ( ( q @ ( f @ SX0 @ ( sK3_S @ SX0 ) ) )
| ( p @ SX0 @ ( sK3_S @ SX0 ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[14]) ).
thf(18,plain,
! [SV1: $i] :
( ( ~ ( q @ SV1 )
| ~ ( m @ ( g @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(19,plain,
( ( ( ! [X: $i,Y: $i] :
~ ( p @ X @ Y ) )
= $true )
| ( ( ! [Z: $i] : ( p @ Z @ Z ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[15]) ).
thf(20,plain,
( ( ( ! [SY8: $i] :
~ ( p @ ( g @ sK2_U ) @ SY8 ) )
= $true )
| ( ( ~ ( p @ sK1_U @ sK1_U ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[16]) ).
thf(21,plain,
! [SV2: $i] :
( ( ~ ( ~ ( ( m @ SV2 )
| ( p @ SV2 @ ( sK3_S @ SV2 ) ) )
| ~ ( ( q @ ( f @ SV2 @ ( sK3_S @ SV2 ) ) )
| ( p @ SV2 @ ( sK3_S @ SV2 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(22,plain,
! [SV1: $i] :
( ( ( ~ ( q @ SV1 ) )
= $true )
| ( ( ~ ( m @ ( g @ SV1 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[18]) ).
thf(23,plain,
! [SV3: $i] :
( ( ( ! [SY9: $i] :
~ ( p @ SV3 @ SY9 ) )
= $true )
| ( ( ! [Z: $i] : ( p @ Z @ Z ) )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(24,plain,
! [SV4: $i] :
( ( ( ~ ( p @ ( g @ sK2_U ) @ SV4 ) )
= $true )
| ( ( ~ ( p @ sK1_U @ sK1_U ) )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(25,plain,
! [SV2: $i] :
( ( ~ ( ( m @ SV2 )
| ( p @ SV2 @ ( sK3_S @ SV2 ) ) )
| ~ ( ( q @ ( f @ SV2 @ ( sK3_S @ SV2 ) ) )
| ( p @ SV2 @ ( sK3_S @ SV2 ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(26,plain,
! [SV1: $i] :
( ( ( q @ SV1 )
= $false )
| ( ( ~ ( m @ ( g @ SV1 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(27,plain,
! [SV5: $i,SV3: $i] :
( ( ( ~ ( p @ SV3 @ SV5 ) )
= $true )
| ( ( ! [Z: $i] : ( p @ Z @ Z ) )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(28,plain,
! [SV4: $i] :
( ( ( p @ ( g @ sK2_U ) @ SV4 )
= $false )
| ( ( ~ ( p @ sK1_U @ sK1_U ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(29,plain,
! [SV2: $i] :
( ( ~ ( ( m @ SV2 )
| ( p @ SV2 @ ( sK3_S @ SV2 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[25]) ).
thf(30,plain,
! [SV2: $i] :
( ( ~ ( ( q @ ( f @ SV2 @ ( sK3_S @ SV2 ) ) )
| ( p @ SV2 @ ( sK3_S @ SV2 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[25]) ).
thf(31,plain,
! [SV1: $i] :
( ( ( m @ ( g @ SV1 ) )
= $false )
| ( ( q @ SV1 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(32,plain,
! [SV5: $i,SV3: $i] :
( ( ( p @ SV3 @ SV5 )
= $false )
| ( ( ! [Z: $i] : ( p @ Z @ Z ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[27]) ).
thf(33,plain,
! [SV4: $i] :
( ( ( p @ sK1_U @ sK1_U )
= $false )
| ( ( p @ ( g @ sK2_U ) @ SV4 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[28]) ).
thf(34,plain,
! [SV2: $i] :
( ( ( m @ SV2 )
| ( p @ SV2 @ ( sK3_S @ SV2 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[29]) ).
thf(35,plain,
! [SV2: $i] :
( ( ( q @ ( f @ SV2 @ ( sK3_S @ SV2 ) ) )
| ( p @ SV2 @ ( sK3_S @ SV2 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[30]) ).
thf(36,plain,
! [SV5: $i,SV3: $i,SV6: $i] :
( ( ( p @ SV6 @ SV6 )
= $true )
| ( ( p @ SV3 @ SV5 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[32]) ).
thf(37,plain,
! [SV2: $i] :
( ( ( m @ SV2 )
= $true )
| ( ( p @ SV2 @ ( sK3_S @ SV2 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[34]) ).
thf(38,plain,
! [SV2: $i] :
( ( ( q @ ( f @ SV2 @ ( sK3_S @ SV2 ) ) )
= $true )
| ( ( p @ SV2 @ ( sK3_S @ SV2 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[35]) ).
thf(39,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[31,38,37,36,33]) ).
thf(40,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN728+1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 12 07:23:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35
% 0.12/0.35 No.of.Axioms: 0
% 0.12/0.35
% 0.12/0.35 Length.of.Defs: 0
% 0.12/0.35
% 0.12/0.35 Contains.Choice.Funs: false
% 0.12/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.19/0.38
% 0.19/0.38 ********************************
% 0.19/0.38 * All subproblems solved! *
% 0.19/0.38 ********************************
% 0.19/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:3,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:39,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.19/0.38
% 0.19/0.38 %**** Beginning of derivation protocol ****
% 0.19/0.38 % SZS output start CNFRefutation
% See solution above
% 0.19/0.38
% 0.19/0.38 %**** End of derivation protocol ****
% 0.19/0.38 %**** no. of clauses in derivation: 40 ****
% 0.19/0.38 %**** clause counter: 39 ****
% 0.19/0.38
% 0.19/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:3,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:39,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------