TSTP Solution File: SYO200^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO200^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 : n027.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 17:32:42 EDT 2022
% Result : Theorem 0.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 32 unt; 2 typ; 0 def)
% Number of atoms : 98 ( 31 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 59 ( 22 ~; 2 |; 2 &; 27 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 0 ^ 22 !; 6 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_sK1_Xx,type,
sK1_Xx: $o ).
thf(tp_sK2_SY3,type,
sK2_SY3: $o ).
thf(1,conjecture,
! [Xx: $o,Xy: $o] :
? [Xp: $o > $o] :
( ( Xp @ Xx )
=> ( Xp @ Xy ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cCT4) ).
thf(2,negated_conjecture,
( ( ! [Xx: $o,Xy: $o] :
? [Xp: $o > $o] :
( ( Xp @ Xx )
=> ( Xp @ Xy ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [Xx: $o,Xy: $o] :
? [Xp: $o > $o] :
( ( Xp @ Xx )
=> ( Xp @ Xy ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [SY3: $o] :
? [SY4: $o > $o] :
( ( SY4 @ sK1_Xx )
=> ( SY4 @ SY3 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[3]) ).
thf(5,plain,
( ( ? [SY5: $o > $o] :
( ( SY5 @ sK1_Xx )
=> ( SY5 @ sK2_SY3 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[4]) ).
thf(6,plain,
( ( ~ ? [SY5: $o > $o] :
( ( SY5 @ sK1_Xx )
=> ( SY5 @ sK2_SY3 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [SY5: $o > $o] : ( SY5 @ sK1_Xx )
& ! [SY5: $o > $o] :
~ ( SY5 @ sK2_SY3 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [SY5: $o > $o] : ( SY5 @ sK1_Xx )
& ! [SY5: $o > $o] :
~ ( SY5 @ sK2_SY3 ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(9,plain,
( ( ~ ( ~ ! [SX0: $o > $o] : ( SX0 @ sK1_Xx )
| ~ ! [SX0: $o > $o] :
~ ( SX0 @ sK2_SY3 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(10,plain,
( ( ~ ! [SX0: $o > $o] : ( SX0 @ sK1_Xx )
| ~ ! [SX0: $o > $o] :
~ ( SX0 @ sK2_SY3 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[9]) ).
thf(11,plain,
( ( ~ ! [SX0: $o > $o] : ( SX0 @ sK1_Xx ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[10]) ).
thf(12,plain,
( ( ~ ! [SX0: $o > $o] :
~ ( SX0 @ sK2_SY3 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[10]) ).
thf(13,plain,
( ( ! [SX0: $o > $o] : ( SX0 @ sK1_Xx ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[11]) ).
thf(14,plain,
( ( ! [SX0: $o > $o] :
~ ( SX0 @ sK2_SY3 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[12]) ).
thf(15,plain,
! [SV1: $o > $o] :
( ( SV1 @ sK1_Xx )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[13]) ).
thf(16,plain,
$true = $true,
inference(extcnf_forall_special_pos,[status(thm)],[13]) ).
thf(17,plain,
$false = $true,
inference(extcnf_forall_special_pos,[status(thm)],[13]) ).
thf(18,plain,
sK1_Xx = $true,
inference(extcnf_forall_special_pos,[status(thm)],[13]) ).
thf(19,plain,
( ( ~ sK1_Xx )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[13]) ).
thf(20,plain,
! [SV3: $o > $o] :
( ( ~ ( SV3 @ sK2_SY3 ) )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[14]) ).
thf(21,plain,
( ( ~ $true )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[14]) ).
thf(22,plain,
( ( ~ $false )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[14]) ).
thf(23,plain,
( ( ~ sK2_SY3 )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[14]) ).
thf(24,plain,
( ( ~ ~ sK2_SY3 )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[14]) ).
thf(25,plain,
sK1_Xx = $false,
inference(extcnf_not_pos,[status(thm)],[19]) ).
thf(26,plain,
! [SV3: $o > $o] :
( ( SV3 @ sK2_SY3 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(27,plain,
$true = $false,
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(28,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(29,plain,
sK2_SY3 = $false,
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(30,plain,
( ( ~ sK2_SY3 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(31,plain,
sK2_SY3 = $true,
inference(extcnf_not_neg,[status(thm)],[30]) ).
thf(32,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[15,31,29,28,27,26,25,18,17,16]) ).
thf(33,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYO200^5 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 9 13:20:46 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 0
% 0.13/0.35
% 0.13/0.35 Length.of.Defs: 0
% 0.13/0.35
% 0.13/0.35 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.20/0.38 ********************************
% 0.20/0.38 * All subproblems solved! *
% 0.20/0.38 ********************************
% 0.20/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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:32,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.38
% 0.20/0.38 %**** Beginning of derivation protocol ****
% 0.20/0.38 % SZS output start CNFRefutation
% See solution above
% 0.20/0.38
% 0.20/0.38 %**** End of derivation protocol ****
% 0.20/0.38 %**** no. of clauses in derivation: 33 ****
% 0.20/0.38 %**** clause counter: 32 ****
% 0.20/0.38
% 0.20/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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:32,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------