TSTP Solution File: SEU697^2 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEU697^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 : n010.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:14:01 EDT 2022
% Result : Theorem 0.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 21 ( 12 unt; 8 typ; 1 def)
% Number of atoms : 62 ( 38 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 128 ( 2 ~; 0 |; 0 &; 114 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 59 ( 41 ^ 18 !; 0 ?; 59 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_dpsetconstr,type,
dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).
thf(tp_in,type,
in: $i > $i > $o ).
thf(tp_lam,type,
lam: $i > $i > ( $i > $i ) > $i ).
thf(tp_sK1_SY0,type,
sK1_SY0: $i ).
thf(tp_sK2_SY32,type,
sK2_SY32: $i ).
thf(tp_sK3_SY39,type,
sK3_SY39: $i > $i ).
thf(tp_sK4_E,type,
sK4_E: $i ).
thf(tp_sK5_E,type,
sK5_E: $i ).
thf(lam,definition,
( lam
= ( ^ [A: $i,B: $i,Xf: $i > $i] :
( dpsetconstr @ A @ B
@ ^ [Xx: $i,Xy: $i] :
( ( Xf @ Xx )
= Xy ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lam) ).
thf(1,conjecture,
! [A: $i,B: $i,Xf: $i > $i] :
( ! [Xx: $i] :
( ( in @ Xx @ A )
=> ( in @ ( Xf @ Xx ) @ B ) )
=> ( ( lam @ A @ B
@ ^ [Xx: $i] : ( Xf @ Xx ) )
= ( lam @ A @ B
@ ^ [Xx: $i] : ( Xf @ Xx ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lam2lamEq) ).
thf(2,negated_conjecture,
( ( ! [A: $i,B: $i,Xf: $i > $i] :
( ! [Xx: $i] :
( ( in @ Xx @ A )
=> ( in @ ( Xf @ Xx ) @ B ) )
=> ( ( lam @ A @ B
@ ^ [Xx: $i] : ( Xf @ Xx ) )
= ( lam @ A @ B
@ ^ [Xx: $i] : ( Xf @ Xx ) ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [SY0: $i,SY1: $i,SY2: $i > $i] :
( ! [Xx: $i] :
( ( in @ Xx @ SY0 )
=> ( in @ ( SY2 @ Xx ) @ SY1 ) )
=> ( ( dpsetconstr @ SY0 @ SY1
@ ^ [SY12: $i,SY13: $i] :
( ( SY2 @ SY12 )
= SY13 ) )
= ( dpsetconstr @ SY0 @ SY1
@ ^ [SY22: $i,SY23: $i] :
( ( SY2 @ SY22 )
= SY23 ) ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2,lam]) ).
thf(4,plain,
( ( ! [SY32: $i,SY33: $i > $i] :
( ! [SY34: $i] :
( ( in @ SY34 @ sK1_SY0 )
=> ( in @ ( SY33 @ SY34 ) @ SY32 ) )
=> ( ( dpsetconstr @ sK1_SY0 @ SY32
@ ^ [SY12: $i,SY13: $i] :
( ( SY33 @ SY12 )
= SY13 ) )
= ( dpsetconstr @ sK1_SY0 @ SY32
@ ^ [SY22: $i,SY23: $i] :
( ( SY33 @ SY22 )
= SY23 ) ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[3]) ).
thf(5,plain,
( ( ! [SY39: $i > $i] :
( ! [SY40: $i] :
( ( in @ SY40 @ sK1_SY0 )
=> ( in @ ( SY39 @ SY40 ) @ sK2_SY32 ) )
=> ( ( dpsetconstr @ sK1_SY0 @ sK2_SY32
@ ^ [SY12: $i,SY13: $i] :
( ( SY39 @ SY12 )
= SY13 ) )
= ( dpsetconstr @ sK1_SY0 @ sK2_SY32
@ ^ [SY22: $i,SY23: $i] :
( ( SY39 @ SY22 )
= SY23 ) ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[4]) ).
thf(6,plain,
( ( ! [SY45: $i] :
( ( in @ SY45 @ sK1_SY0 )
=> ( in @ ( sK3_SY39 @ SY45 ) @ sK2_SY32 ) )
=> ( ( dpsetconstr @ sK1_SY0 @ sK2_SY32
@ ^ [SY46: $i,SY47: $i] :
( ( sK3_SY39 @ SY46 )
= SY47 ) )
= ( dpsetconstr @ sK1_SY0 @ sK2_SY32
@ ^ [SY48: $i,SY49: $i] :
( ( sK3_SY39 @ SY48 )
= SY49 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[5]) ).
thf(8,plain,
( ( ( dpsetconstr @ sK1_SY0 @ sK2_SY32
@ ^ [SY46: $i,SY47: $i] :
( ( sK3_SY39 @ SY46 )
= SY47 ) )
= ( dpsetconstr @ sK1_SY0 @ sK2_SY32
@ ^ [SY48: $i,SY49: $i] :
( ( sK3_SY39 @ SY48 )
= SY49 ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[6]) ).
thf(9,plain,
( ( ( ( dpsetconstr @ sK1_SY0 @ sK2_SY32
@ ^ [SY46: $i,SY47: $i] :
( ( sK3_SY39 @ SY46 )
= SY47 ) )
!= ( dpsetconstr @ sK1_SY0 @ sK2_SY32
@ ^ [SY48: $i,SY49: $i] :
( ( sK3_SY39 @ SY48 )
= SY49 ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(12,plain,
( ( ( ( dpsetconstr @ sK1_SY0 @ sK2_SY32
@ ^ [SY46: $i,SY47: $i] :
( ( sK3_SY39 @ SY46 )
= SY47 ) )
!= ( dpsetconstr @ sK1_SY0 @ sK2_SY32
@ ^ [SY48: $i,SY49: $i] :
( ( sK3_SY39 @ SY48 )
= SY49 ) ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(14,plain,
( ( ( dpsetconstr @ sK1_SY0 @ sK2_SY32
@ ^ [SY46: $i,SY47: $i] :
( ( sK3_SY39 @ SY46 )
= SY47 ) )
= ( dpsetconstr @ sK1_SY0 @ sK2_SY32
@ ^ [SY48: $i,SY49: $i] :
( ( sK3_SY39 @ SY48 )
= SY49 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(17,plain,
$false = $true,
inference(extuni,[status(esa)],[14]) ).
thf(18,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU697^2 : TPTP v8.1.0. Released v3.7.0.
% 0.03/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 20 05:29:22 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35
% 0.14/0.35 No.of.Axioms: 0
% 0.14/0.35
% 0.14/0.35 Length.of.Defs: 174
% 0.14/0.35
% 0.14/0.35 Contains.Choice.Funs: false
% 0.14/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 ********************************
% 0.20/0.38 * All subproblems solved! *
% 0.20/0.38 ********************************
% 0.20/0.38 % SZS status Theorem for /export/starexec/sandbox/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:17,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: 12 ****
% 0.20/0.38 %**** clause counter: 17 ****
% 0.20/0.38
% 0.20/0.38 % SZS status Theorem for /export/starexec/sandbox/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:17,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------