TSTP Solution File: SYN926+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN926+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n029.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:30:36 EDT 2022
% Result : Theorem 0.18s 0.37s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 38 ( 34 unt; 3 typ; 0 def)
% Number of atoms : 119 ( 33 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 90 ( 22 ~; 4 |; 11 &; 50 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 ^ 8 !; 16 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_p,type,
p: $i > $o ).
thf(tp_q,type,
q: $i > $o ).
thf(tp_sK1_X,type,
sK1_X: $i ).
thf(1,conjecture,
( ? [X: $i] :
( ( p @ X )
& ( q @ X ) )
=> ( ? [X: $i] : ( p @ X )
& ? [X: $i] : ( q @ X ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
( ( ? [X: $i] :
( ( p @ X )
& ( q @ X ) )
=> ( ? [X: $i] : ( p @ X )
& ? [X: $i] : ( q @ X ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ? [X: $i] :
( ( p @ X )
& ( q @ X ) )
=> ( ? [X: $i] : ( p @ X )
& ? [X: $i] : ( q @ X ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ? [X: $i] :
( ( p @ X )
& ( q @ X ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ? [X: $i] : ( p @ X )
& ? [X: $i] : ( q @ X ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ? [X: $i] : ( p @ X ) )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[5]) ).
thf(7,plain,
( ( ? [X: $i] : ( q @ X ) )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[5]) ).
thf(8,plain,
( ( ~ ? [X: $i] : ( p @ X ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(9,plain,
( ( ~ ? [X: $i] : ( q @ X ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(10,plain,
( ( ! [X: $i] :
~ ( p @ X ) )
= $true ),
inference(extcnf_combined,[status(esa)],[8]) ).
thf(11,plain,
( ( ! [X: $i] :
~ ( q @ X ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(12,plain,
( ( ( p @ sK1_X )
& ( q @ sK1_X ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(13,plain,
( ( ( p @ sK1_X )
& ( q @ sK1_X ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(14,plain,
( ( ! [X: $i] :
~ ( p @ X ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(15,plain,
( ( ~ ( ~ ( p @ sK1_X )
| ~ ( q @ sK1_X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[13]) ).
thf(16,plain,
! [SV1: $i] :
( ( ~ ( p @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(17,plain,
( ( ~ ( p @ sK1_X )
| ~ ( q @ sK1_X ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(18,plain,
! [SV1: $i] :
( ( p @ SV1 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(19,plain,
( ( ~ ( p @ sK1_X ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[17]) ).
thf(20,plain,
( ( ~ ( q @ sK1_X ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[17]) ).
thf(21,plain,
( ( p @ sK1_X )
= $true ),
inference(extcnf_not_neg,[status(thm)],[19]) ).
thf(22,plain,
( ( q @ sK1_X )
= $true ),
inference(extcnf_not_neg,[status(thm)],[20]) ).
thf(23,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[18,22,21]) ).
thf(24,plain,
( ( ( p @ sK1_X )
& ( q @ sK1_X ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(25,plain,
( ( ! [X: $i] :
~ ( q @ X ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(26,plain,
( ( ~ ( ~ ( p @ sK1_X )
| ~ ( q @ sK1_X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[24]) ).
thf(27,plain,
! [SV2: $i] :
( ( ~ ( q @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[25]) ).
thf(28,plain,
( ( ~ ( p @ sK1_X )
| ~ ( q @ sK1_X ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(29,plain,
! [SV2: $i] :
( ( q @ SV2 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[27]) ).
thf(30,plain,
( ( ~ ( p @ sK1_X ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[28]) ).
thf(31,plain,
( ( ~ ( q @ sK1_X ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[28]) ).
thf(32,plain,
( ( p @ sK1_X )
= $true ),
inference(extcnf_not_neg,[status(thm)],[30]) ).
thf(33,plain,
( ( q @ sK1_X )
= $true ),
inference(extcnf_not_neg,[status(thm)],[31]) ).
thf(34,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[29,33,32]) ).
thf(35,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[34,23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN926+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jul 12 00:04:17 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.33
% 0.11/0.33 No.of.Axioms: 0
% 0.11/0.33
% 0.11/0.33 Length.of.Defs: 0
% 0.11/0.33
% 0.11/0.33 Contains.Choice.Funs: false
% 0.11/0.33 (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.18/0.37 ********************************
% 0.18/0.37 * All subproblems solved! *
% 0.18/0.37 ********************************
% 0.18/0.37 % SZS status Theorem for /export/starexec/sandbox2/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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:34,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.18/0.37
% 0.18/0.37 %**** Beginning of derivation protocol ****
% 0.18/0.37 % SZS output start CNFRefutation
% See solution above
% 0.18/0.37
% 0.18/0.37 %**** End of derivation protocol ****
% 0.18/0.37 %**** no. of clauses in derivation: 35 ****
% 0.18/0.37 %**** clause counter: 34 ****
% 0.18/0.37
% 0.18/0.37 % SZS status Theorem for /export/starexec/sandbox2/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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:34,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------