TSTP Solution File: SEU930^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEU930^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 : Tue Jul 19 12:15:47 EDT 2022
% Result : Theorem 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 26 unt; 3 typ; 0 def)
% Number of atoms : 128 ( 97 equ; 0 cnn)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 157 ( 41 ~; 19 |; 9 &; 75 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 12 ^ 24 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_f,type,
f: $i > $i ).
thf(tp_g,type,
g: $i > $i ).
thf(tp_sK1_Xx,type,
sK1_Xx: $i ).
thf(1,conjecture,
( ( ( ^ [Xx: $i] : ( f @ ( g @ Xx ) ) )
= ( ^ [Xx: $i] : ( g @ ( f @ Xx ) ) ) )
=> ! [Xx: $i] :
( ( ( ( g @ Xx )
= Xx )
& ! [Xz: $i] :
( ( ( g @ Xz )
= Xz )
=> ( Xz = Xx ) ) )
=> ( ( f @ Xx )
= Xx ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM171A_pme) ).
thf(2,negated_conjecture,
( ( ( ( ^ [Xx: $i] : ( f @ ( g @ Xx ) ) )
= ( ^ [Xx: $i] : ( g @ ( f @ Xx ) ) ) )
=> ! [Xx: $i] :
( ( ( ( g @ Xx )
= Xx )
& ! [Xz: $i] :
( ( ( g @ Xz )
= Xz )
=> ( Xz = Xx ) ) )
=> ( ( f @ Xx )
= Xx ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ( ^ [Xx: $i] : ( f @ ( g @ Xx ) ) )
= ( ^ [Xx: $i] : ( g @ ( f @ Xx ) ) ) )
=> ! [Xx: $i] :
( ( ( ( g @ Xx )
= Xx )
& ! [Xz: $i] :
( ( ( g @ Xz )
= Xz )
=> ( Xz = Xx ) ) )
=> ( ( f @ Xx )
= Xx ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ( ^ [Xx: $i] : ( f @ ( g @ Xx ) ) )
= ( ^ [Xx: $i] : ( g @ ( f @ Xx ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Xx: $i] :
( ( ( ( g @ Xx )
= Xx )
& ! [Xz: $i] :
( ( ( g @ Xz )
= Xz )
=> ( Xz = Xx ) ) )
=> ( ( f @ Xx )
= Xx ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ~ ! [Xx: $i] :
( ( ( ( g @ Xx )
= Xx )
& ! [Xz: $i] :
( ( ( g @ Xz )
= Xz )
=> ( Xz = Xx ) ) )
=> ( ( f @ Xx )
= Xx ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [SY4: $i] :
( ( ( g @ SY4 )
!= SY4 )
| ( SY4 = sK1_Xx ) )
& ( ( g @ sK1_Xx )
= sK1_Xx )
& ( ( f @ sK1_Xx )
!= sK1_Xx ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ( ^ [Xx: $i] : ( f @ ( g @ Xx ) ) )
= ( ^ [Xx: $i] : ( g @ ( f @ Xx ) ) ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(9,plain,
( ( ! [SY4: $i] :
( ( ( g @ SY4 )
!= SY4 )
| ( SY4 = sK1_Xx ) )
& ( ( g @ sK1_Xx )
= sK1_Xx )
& ( ( f @ sK1_Xx )
!= sK1_Xx ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(10,plain,
( ( ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ( ( g @ SX0 )
!= SX0 )
| ( SX0 = sK1_Xx ) )
| ( ( g @ sK1_Xx )
!= sK1_Xx ) )
| ~ ( ( ( f @ sK1_Xx )
!= sK1_Xx ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(11,plain,
( ( ! [SV1: $i] :
( ( f @ ( g @ SV1 ) )
= ( g @ ( f @ SV1 ) ) ) )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[8]) ).
thf(12,plain,
( ( ( ^ [Xx: $i] : ( f @ ( g @ Xx ) ) )
= ( ^ [Xx: $i] : ( g @ ( f @ Xx ) ) ) )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[8]) ).
thf(13,plain,
( ( ~ ~ ( ~ ! [SX0: $i] :
( ( ( g @ SX0 )
!= SX0 )
| ( SX0 = sK1_Xx ) )
| ( ( g @ sK1_Xx )
!= sK1_Xx ) )
| ~ ( ( ( f @ sK1_Xx )
!= sK1_Xx ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[10]) ).
thf(14,plain,
! [SV2: $i] :
( ( ( f @ ( g @ SV2 ) )
= ( g @ ( f @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(15,plain,
( ( ~ ~ ( ~ ! [SX0: $i] :
( ( ( g @ SX0 )
!= SX0 )
| ( SX0 = sK1_Xx ) )
| ( ( g @ sK1_Xx )
!= sK1_Xx ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ ( ( ( f @ sK1_Xx )
!= sK1_Xx ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(17,plain,
( ( ~ ( ~ ! [SX0: $i] :
( ( ( g @ SX0 )
!= SX0 )
| ( SX0 = sK1_Xx ) )
| ( ( g @ sK1_Xx )
!= sK1_Xx ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[15]) ).
thf(18,plain,
( ( ( ( f @ sK1_Xx )
!= sK1_Xx ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(19,plain,
( ( ~ ! [SX0: $i] :
( ( ( g @ SX0 )
!= SX0 )
| ( SX0 = sK1_Xx ) )
| ( ( g @ sK1_Xx )
!= sK1_Xx ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(20,plain,
( ( ( f @ sK1_Xx )
= sK1_Xx )
= $false ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(21,plain,
( ( ~ ! [SX0: $i] :
( ( ( g @ SX0 )
!= SX0 )
| ( SX0 = sK1_Xx ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[19]) ).
thf(22,plain,
( ( ( ( g @ sK1_Xx )
!= sK1_Xx ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[19]) ).
thf(23,plain,
( ( ! [SX0: $i] :
( ( ( g @ SX0 )
!= SX0 )
| ( SX0 = sK1_Xx ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[21]) ).
thf(24,plain,
( ( ( g @ sK1_Xx )
= sK1_Xx )
= $true ),
inference(extcnf_not_neg,[status(thm)],[22]) ).
thf(25,plain,
! [SV3: $i] :
( ( ( ( g @ SV3 )
!= SV3 )
| ( SV3 = sK1_Xx ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(26,plain,
! [SV3: $i] :
( ( ( ( ( g @ SV3 )
!= SV3 ) )
= $true )
| ( ( SV3 = sK1_Xx )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[25]) ).
thf(27,plain,
! [SV3: $i] :
( ( ( ( g @ SV3 )
= SV3 )
= $false )
| ( ( SV3 = sK1_Xx )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(28,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[12,27,24,20,14]) ).
thf(29,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU930^5 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.34 % Computer : n016.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 : Sat Jun 18 20:25:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35
% 0.12/0.35 No.of.Axioms: 0
% 0.12/0.35
% 0.12/0.35 Length.of.Defs: 0
% 0.12/0.35
% 0.12/0.35 Contains.Choice.Funs: false
% 0.12/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.12/0.38
% 0.12/0.38 ********************************
% 0.12/0.38 * All subproblems solved! *
% 0.12/0.38 ********************************
% 0.12/0.38 % 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:28,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.38
% 0.12/0.38 %**** Beginning of derivation protocol ****
% 0.12/0.38 % SZS output start CNFRefutation
% See solution above
% 0.12/0.38
% 0.12/0.38 %**** End of derivation protocol ****
% 0.12/0.38 %**** no. of clauses in derivation: 29 ****
% 0.12/0.38 %**** clause counter: 28 ****
% 0.12/0.38
% 0.12/0.38 % 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:28,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------