TSTP Solution File: SEU693^2 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEU693^2 : TPTP v8.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n017.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 : Tue Jul 19 12:13:59 EDT 2022
% Result : Theorem 0.20s 0.37s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 20 unt; 7 typ; 0 def)
% Number of atoms : 77 ( 27 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 156 ( 14 ~; 2 |; 2 &; 124 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-4 aty)
% Number of variables : 20 ( 0 ^ 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_ap,type,
ap: $i > $i > $i > $i > $i ).
thf(tp_funcSet,type,
funcSet: $i > $i > $i ).
thf(tp_in,type,
in: $i > $i > $o ).
thf(tp_sK1_A,type,
sK1_A: $i ).
thf(tp_sK2_SY4,type,
sK2_SY4: $i ).
thf(tp_sK3_SY7,type,
sK3_SY7: $i ).
thf(tp_sK4_SY9,type,
sK4_SY9: $i ).
thf(1,conjecture,
! [A: $i,B: $i,Xf: $i] :
( ( in @ Xf @ ( funcSet @ A @ B ) )
=> ! [Xx: $i] :
( ( in @ Xx @ A )
=> ( ( ap @ A @ B @ Xf @ Xx )
= ( ap @ A @ B @ Xf @ Xx ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap2apEq1) ).
thf(2,negated_conjecture,
( ( ! [A: $i,B: $i,Xf: $i] :
( ( in @ Xf @ ( funcSet @ A @ B ) )
=> ! [Xx: $i] :
( ( in @ Xx @ A )
=> ( ( ap @ A @ B @ Xf @ Xx )
= ( ap @ A @ B @ Xf @ Xx ) ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [A: $i,B: $i,Xf: $i] :
( ( in @ Xf @ ( funcSet @ A @ B ) )
=> ! [Xx: $i] :
( ( in @ Xx @ A )
=> ( ( ap @ A @ B @ Xf @ Xx )
= ( ap @ A @ B @ Xf @ Xx ) ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [SY4: $i,SY5: $i] :
( ( in @ SY5 @ ( funcSet @ sK1_A @ SY4 ) )
=> ! [SY6: $i] :
( ( in @ SY6 @ sK1_A )
=> ( ( ap @ sK1_A @ SY4 @ SY5 @ SY6 )
= ( ap @ sK1_A @ SY4 @ SY5 @ SY6 ) ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[3]) ).
thf(5,plain,
( ( ! [SY7: $i] :
( ( in @ SY7 @ ( funcSet @ sK1_A @ sK2_SY4 ) )
=> ! [SY8: $i] :
( ( in @ SY8 @ sK1_A )
=> ( ( ap @ sK1_A @ sK2_SY4 @ SY7 @ SY8 )
= ( ap @ sK1_A @ sK2_SY4 @ SY7 @ SY8 ) ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[4]) ).
thf(6,plain,
( ( ( in @ sK3_SY7 @ ( funcSet @ sK1_A @ sK2_SY4 ) )
=> ! [SY9: $i] :
( ( in @ SY9 @ sK1_A )
=> ( ( ap @ sK1_A @ sK2_SY4 @ sK3_SY7 @ SY9 )
= ( ap @ sK1_A @ sK2_SY4 @ sK3_SY7 @ SY9 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[5]) ).
thf(7,plain,
( ( in @ sK3_SY7 @ ( funcSet @ sK1_A @ sK2_SY4 ) )
= $true ),
inference(standard_cnf,[status(thm)],[6]) ).
thf(8,plain,
( ( ! [SY9: $i] :
( ( in @ SY9 @ sK1_A )
=> ( ( ap @ sK1_A @ sK2_SY4 @ sK3_SY7 @ SY9 )
= ( ap @ sK1_A @ sK2_SY4 @ sK3_SY7 @ SY9 ) ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[6]) ).
thf(9,plain,
( ( ~ ! [SY9: $i] :
( ( in @ SY9 @ sK1_A )
=> ( ( ap @ sK1_A @ sK2_SY4 @ sK3_SY7 @ SY9 )
= ( ap @ sK1_A @ sK2_SY4 @ sK3_SY7 @ SY9 ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(10,plain,
( ( ( in @ sK4_SY9 @ sK1_A )
& ~ $true )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(11,plain,
( ( in @ sK3_SY7 @ ( funcSet @ sK1_A @ sK2_SY4 ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(12,plain,
( ( ( in @ sK4_SY9 @ sK1_A )
& ~ $true )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(13,plain,
( ( ~ ( ~ ( in @ sK4_SY9 @ sK1_A )
| ~ ~ $true ) )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(14,plain,
( ( ~ ( in @ sK4_SY9 @ sK1_A )
| ~ ~ $true )
= $false ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(15,plain,
( ( ~ ( in @ sK4_SY9 @ sK1_A ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(16,plain,
( ( ~ ~ $true )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(17,plain,
( ( in @ sK4_SY9 @ sK1_A )
= $true ),
inference(extcnf_not_neg,[status(thm)],[15]) ).
thf(18,plain,
( ( ~ $true )
= $true ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(19,plain,
$true = $false,
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(20,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[11,19,17]) ).
thf(21,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : SEU693^2 : TPTP v8.1.0. Released v3.7.0.
% 0.04/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 20 01:20:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 0
% 0.13/0.34
% 0.13/0.34 Length.of.Defs: 0
% 0.13/0.34
% 0.13/0.34 Contains.Choice.Funs: false
% 0.13/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.37 ********************************
% 0.20/0.37 * All subproblems solved! *
% 0.20/0.37 ********************************
% 0.20/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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:20,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.37
% 0.20/0.37 %**** Beginning of derivation protocol ****
% 0.20/0.37 % SZS output start CNFRefutation
% See solution above
% 0.20/0.37
% 0.20/0.37 %**** End of derivation protocol ****
% 0.20/0.37 %**** no. of clauses in derivation: 21 ****
% 0.20/0.37 %**** clause counter: 20 ****
% 0.20/0.37
% 0.20/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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:20,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------