TSTP Solution File: SYO258^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO258^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 : n016.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:33:01 EDT 2022
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 14 unt; 5 typ; 0 def)
% Number of atoms : 55 ( 13 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 147 ( 25 ~; 13 |; 15 &; 86 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 22 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 0 ^ 20 !; 10 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_b,type,
b: $i ).
thf(tp_cP,type,
cP: $i > $i > $o ).
thf(tp_cQ,type,
cQ: $i > ( $i > $o ) > $o ).
thf(tp_sK1_Xg,type,
sK1_Xg: ( $i > $o ) > $i ).
thf(1,conjecture,
( ( ( cP @ a @ b )
& ! [E: $i > $o] : ( cQ @ b @ E ) )
=> ? [A: $i > $o] :
! [Xg: $i] :
( ( A @ Xg )
=> ( ? [Xx: $i] :
( ( cP @ Xg @ Xx )
& ( cQ @ Xx @ A ) )
& ( A @ a ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE_FENG_6) ).
thf(2,negated_conjecture,
( ( ( ( cP @ a @ b )
& ! [E: $i > $o] : ( cQ @ b @ E ) )
=> ? [A: $i > $o] :
! [Xg: $i] :
( ( A @ Xg )
=> ( ? [Xx: $i] :
( ( cP @ Xg @ Xx )
& ( cQ @ Xx @ A ) )
& ( A @ a ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ( cP @ a @ b )
& ! [E: $i > $o] : ( cQ @ b @ E ) )
=> ? [A: $i > $o] :
! [Xg: $i] :
( ( A @ Xg )
=> ( ? [Xx: $i] :
( ( cP @ Xg @ Xx )
& ( cQ @ Xx @ A ) )
& ( A @ a ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(6,plain,
( ( ? [A: $i > $o] :
! [Xg: $i] :
( ( A @ Xg )
=> ( ? [Xx: $i] :
( ( cP @ Xg @ Xx )
& ( cQ @ Xx @ A ) )
& ( A @ a ) ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ~ ? [A: $i > $o] :
! [Xg: $i] :
( ( A @ Xg )
=> ( ? [Xx: $i] :
( ( cP @ Xg @ Xx )
& ( cQ @ Xx @ A ) )
& ( A @ a ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(8,plain,
( ( ! [A: $i > $o] :
( ( A @ ( sK1_Xg @ A ) )
& ( ! [SY4: $i] :
( ~ ( cP @ ( sK1_Xg @ A ) @ SY4 )
| ~ ( cQ @ SY4 @ A ) )
| ~ ( A @ a ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(11,plain,
( ( ! [A: $i > $o] :
( ( A @ ( sK1_Xg @ A ) )
& ( ! [SY4: $i] :
( ~ ( cP @ ( sK1_Xg @ A ) @ SY4 )
| ~ ( cQ @ SY4 @ A ) )
| ~ ( A @ a ) ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(12,plain,
( ( ! [SX0: $i > $o] :
~ ( ~ ( SX0 @ ( sK1_Xg @ SX0 ) )
| ~ ( ! [SX1: $i] :
( ~ ( cP @ ( sK1_Xg @ SX0 ) @ SX1 )
| ~ ( cQ @ SX1 @ SX0 ) )
| ~ ( SX0 @ a ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(14,plain,
! [SV2: $i > $o] :
( ( ~ ( ~ ( SV2 @ ( sK1_Xg @ SV2 ) )
| ~ ( ! [SY5: $i] :
( ~ ( cP @ ( sK1_Xg @ SV2 ) @ SY5 )
| ~ ( cQ @ SY5 @ SV2 ) )
| ~ ( SV2 @ a ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(15,plain,
! [SV2: $i > $o] :
( ( ~ ( SV2 @ ( sK1_Xg @ SV2 ) )
| ~ ( ! [SY5: $i] :
( ~ ( cP @ ( sK1_Xg @ SV2 ) @ SY5 )
| ~ ( cQ @ SY5 @ SV2 ) )
| ~ ( SV2 @ a ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[14]) ).
thf(16,plain,
! [SV2: $i > $o] :
( ( ~ ( SV2 @ ( sK1_Xg @ SV2 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[15]) ).
thf(18,plain,
! [SV2: $i > $o] :
( ( SV2 @ ( sK1_Xg @ SV2 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(27,plain,
$false = $true,
inference(prim_subst,[status(thm)],[18:[bind(SV2,$thf( ^ [SV6: $i] : $false ))]]) ).
thf(39,plain,
$false = $true,
inference(sim,[status(thm)],[27]) ).
thf(40,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYO258^5 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 18:00:08 EDT 2022
% 0.13/0.34 % 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.13/0.38
% 0.13/0.38 ********************************
% 0.13/0.38 * All subproblems solved! *
% 0.13/0.38 ********************************
% 0.13/0.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:2,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:39,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.38
% 0.13/0.38 %**** Beginning of derivation protocol ****
% 0.13/0.38 % SZS output start CNFRefutation
% See solution above
% 0.13/0.38
% 0.13/0.38 %**** End of derivation protocol ****
% 0.13/0.38 %**** no. of clauses in derivation: 15 ****
% 0.13/0.38 %**** clause counter: 39 ****
% 0.13/0.38
% 0.13/0.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:2,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:39,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------