TSTP Solution File: SYO198^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO198^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 : n007.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:41 EDT 2022
% Result : Theorem 0.20s 0.36s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 14 unt; 2 typ; 0 def)
% Number of atoms : 149 ( 47 equ; 0 cnn)
% Maximal formula atoms : 2 ( 4 avg)
% Number of connectives : 93 ( 39 ~; 24 |; 6 &; 24 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 0 ^ 13 !; 6 ?; 19 :)
% 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/sandbox/benchmark/theBenchmark.p',cCT8) ).
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 @ sK2_SY3 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [SY5: $o > $o] :
( ~ ( SY5 @ sK1_Xx )
| ~ ( SY5 @ sK2_SY3 ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(9,plain,
! [SV1: $o > $o] :
( ( ~ ( SV1 @ sK1_Xx )
| ~ ( SV1 @ sK2_SY3 ) )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[8]) ).
thf(10,plain,
( ( ~ $true
| ~ $true )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[8]) ).
thf(11,plain,
( ( ~ $false
| ~ $false )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[8]) ).
thf(12,plain,
( ( ~ sK1_Xx
| ~ sK2_SY3 )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[8]) ).
thf(13,plain,
( ( ~ ~ sK1_Xx
| ~ ~ sK2_SY3 )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[8]) ).
thf(14,plain,
! [SV1: $o > $o] :
( ( ( ~ ( SV1 @ sK1_Xx ) )
= $true )
| ( ( ~ ( SV1 @ sK2_SY3 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[9]) ).
thf(15,plain,
( ( ( ~ $true )
= $true )
| ( ( ~ $true )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[10]) ).
thf(16,plain,
( ( ( ~ $false )
= $true )
| ( ( ~ $false )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[11]) ).
thf(17,plain,
( ( ( ~ sK1_Xx )
= $true )
| ( ( ~ sK2_SY3 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[12]) ).
thf(18,plain,
( ( ( ~ ~ sK1_Xx )
= $true )
| ( ( ~ ~ sK2_SY3 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[13]) ).
thf(19,plain,
! [SV1: $o > $o] :
( ( ( SV1 @ sK1_Xx )
= $false )
| ( ( ~ ( SV1 @ sK2_SY3 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[14]) ).
thf(20,plain,
( ( $true = $false )
| ( ( ~ $true )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(21,plain,
( ( $false = $false )
| ( ( ~ $false )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(22,plain,
( ( sK1_Xx = $false )
| ( ( ~ sK2_SY3 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(23,plain,
( ( ( ~ sK1_Xx )
= $false )
| ( ( ~ ~ sK2_SY3 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(24,plain,
! [SV1: $o > $o] :
( ( ( SV1 @ sK2_SY3 )
= $false )
| ( ( SV1 @ sK1_Xx )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[19]) ).
thf(25,plain,
( ( $true = $false )
| ( $true = $false ) ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(26,plain,
( ( $false = $false )
| ( $false = $false ) ),
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(27,plain,
( ( sK2_SY3 = $false )
| ( sK1_Xx = $false ) ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(28,plain,
( ( sK1_Xx = $true )
| ( ( ~ ~ sK2_SY3 )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[23]) ).
thf(29,plain,
( ( ( ~ sK2_SY3 )
= $false )
| ( sK1_Xx = $true ) ),
inference(extcnf_not_pos,[status(thm)],[28]) ).
thf(30,plain,
( ( sK2_SY3 = $true )
| ( sK1_Xx = $true ) ),
inference(extcnf_not_neg,[status(thm)],[29]) ).
thf(31,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[24,30,27,26,25]) ).
thf(32,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYO198^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.12/0.34 % Computer : n007.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 : Fri Jul 8 18:45:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 0
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/0.34 (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.36 ********************************
% 0.20/0.36 * All subproblems solved! *
% 0.20/0.36 ********************************
% 0.20/0.36 % SZS status Theorem for /export/starexec/sandbox/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:31,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.36
% 0.20/0.36 %**** Beginning of derivation protocol ****
% 0.20/0.36 % SZS output start CNFRefutation
% See solution above
% 0.20/0.36
% 0.20/0.36 %**** End of derivation protocol ****
% 0.20/0.36 %**** no. of clauses in derivation: 32 ****
% 0.20/0.36 %**** clause counter: 31 ****
% 0.20/0.36
% 0.20/0.36 % SZS status Theorem for /export/starexec/sandbox/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:31,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------