TSTP Solution File: SYO053^2 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO053^2 : 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 : n028.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:31:44 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 65
% Syntax : Number of formulae : 79 ( 45 unt; 33 typ; 31 def)
% Number of atoms : 141 ( 49 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 181 ( 22 ~; 9 |; 8 &; 134 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 196 ( 196 >; 0 *; 0 +; 0 <<)
% Number of symbols : 35 ( 32 usr; 2 con; 0-3 aty)
% Number of variables : 107 ( 49 ^ 49 !; 9 ?; 107 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_mu,type,
mu: $tType ).
thf(tp_mand,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_mbox,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_mcountersatisfiable,type,
mcountersatisfiable: ( $i > $o ) > $o ).
thf(tp_mdia,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_meq_ind,type,
meq_ind: mu > mu > $i > $o ).
thf(tp_meq_prop,type,
meq_prop: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_mequiv,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_meuclidean,type,
meuclidean: ( $i > $i > $o ) > $o ).
thf(tp_mexists_ind,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(tp_mexists_prop,type,
mexists_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(tp_mfalse,type,
mfalse: $i > $o ).
thf(tp_mforall_ind,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(tp_mforall_prop,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(tp_mfunctional,type,
mfunctional: ( $i > $i > $o ) > $o ).
thf(tp_mimplied,type,
mimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_mimplies,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_minvalid,type,
minvalid: ( $i > $o ) > $o ).
thf(tp_mnot,type,
mnot: ( $i > $o ) > $i > $o ).
thf(tp_mor,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_mpartially_functional,type,
mpartially_functional: ( $i > $i > $o ) > $o ).
thf(tp_mreflexive,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(tp_msatisfiable,type,
msatisfiable: ( $i > $o ) > $o ).
thf(tp_mserial,type,
mserial: ( $i > $i > $o ) > $o ).
thf(tp_msymmetric,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(tp_mtransitive,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(tp_mtrue,type,
mtrue: $i > $o ).
thf(tp_mvalid,type,
mvalid: ( $i > $o ) > $o ).
thf(tp_mweakly_connected,type,
mweakly_connected: ( $i > $i > $o ) > $o ).
thf(tp_mweakly_dense,type,
mweakly_dense: ( $i > $i > $o ) > $o ).
thf(tp_mweakly_directed,type,
mweakly_directed: ( $i > $i > $o ) > $o ).
thf(tp_mxor,type,
mxor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_sK1_SY2,type,
sK1_SY2: $i > ( $i > $i > $o ) > $i ).
thf(mand,definition,
( mand
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mor @ ( mnot @ Phi ) @ ( mnot @ Psi ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mand) ).
thf(mbox,definition,
( mbox
= ( ^ [R: $i > $i > $o,Phi: $i > $o,W: $i] :
! [V: $i] :
( ~ ( R @ W @ V )
| ( Phi @ V ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox) ).
thf(mcountersatisfiable,definition,
( mcountersatisfiable
= ( ^ [Phi: $i > $o] :
? [W: $i] :
~ ( Phi @ W ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mcountersatisfiable) ).
thf(mdia,definition,
( mdia
= ( ^ [R: $i > $i > $o,Phi: $i > $o] : ( mnot @ ( mbox @ R @ ( mnot @ Phi ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mdia) ).
thf(meq_ind,definition,
( meq_ind
= ( ^ [X: mu,Y: mu,W: $i] : ( X = Y ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meq_ind) ).
thf(meq_prop,definition,
( meq_prop
= ( ^ [X: $i > $o,Y: $i > $o,W: $i] :
( ( X @ W )
= ( Y @ W ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meq_prop) ).
thf(mequiv,definition,
( mequiv
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mand @ ( mimplies @ Phi @ Psi ) @ ( mimplies @ Psi @ Phi ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mequiv) ).
thf(meuclidean,definition,
( meuclidean
= ( ^ [R: $i > $i > $o] :
! [S: $i,T: $i,U: $i] :
( ( ( R @ S @ T )
& ( R @ S @ U ) )
=> ( R @ T @ U ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meuclidean) ).
thf(mexists_ind,definition,
( mexists_ind
= ( ^ [Phi: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X: mu] : ( mnot @ ( Phi @ X ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mexists_ind) ).
thf(mexists_prop,definition,
( mexists_prop
= ( ^ [Phi: ( $i > $o ) > $i > $o] :
( mnot
@ ( mforall_prop
@ ^ [P: $i > $o] : ( mnot @ ( Phi @ P ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mexists_prop) ).
thf(mfalse,definition,
( mfalse
= ( mnot @ mtrue ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mfalse) ).
thf(mforall_ind,definition,
( mforall_ind
= ( ^ [Phi: mu > $i > $o,W: $i] :
! [X: mu] : ( Phi @ X @ W ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_ind) ).
thf(mforall_prop,definition,
( mforall_prop
= ( ^ [Phi: ( $i > $o ) > $i > $o,W: $i] :
! [P: $i > $o] : ( Phi @ P @ W ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_prop) ).
thf(mfunctional,definition,
( mfunctional
= ( ^ [R: $i > $i > $o] :
! [S: $i] :
? [T: $i] :
( ( R @ S @ T )
& ! [U: $i] :
( ( R @ S @ U )
=> ( T = U ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mfunctional) ).
thf(mimplied,definition,
( mimplied
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Psi ) @ Phi ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplied) ).
thf(mimplies,definition,
( mimplies
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies) ).
thf(minvalid,definition,
( minvalid
= ( ^ [Phi: $i > $o] :
! [W: $i] :
~ ( Phi @ W ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',minvalid) ).
thf(mnot,definition,
( mnot
= ( ^ [Phi: $i > $o,W: $i] :
~ ( Phi @ W ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot) ).
thf(mor,definition,
( mor
= ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
( ( Phi @ W )
| ( Psi @ W ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor) ).
thf(mpartially_functional,definition,
( mpartially_functional
= ( ^ [R: $i > $i > $o] :
! [S: $i,T: $i,U: $i] :
( ( ( R @ S @ T )
& ( R @ S @ U ) )
=> ( T = U ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mpartially_functional) ).
thf(mreflexive,definition,
( mreflexive
= ( ^ [R: $i > $i > $o] :
! [S: $i] : ( R @ S @ S ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mreflexive) ).
thf(msatisfiable,definition,
( msatisfiable
= ( ^ [Phi: $i > $o] :
? [W: $i] : ( Phi @ W ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',msatisfiable) ).
thf(mserial,definition,
( mserial
= ( ^ [R: $i > $i > $o] :
! [S: $i] :
? [T: $i] : ( R @ S @ T ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mserial) ).
thf(msymmetric,definition,
( msymmetric
= ( ^ [R: $i > $i > $o] :
! [S: $i,T: $i] :
( ( R @ S @ T )
=> ( R @ T @ S ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',msymmetric) ).
thf(mtransitive,definition,
( mtransitive
= ( ^ [R: $i > $i > $o] :
! [S: $i,T: $i,U: $i] :
( ( ( R @ S @ T )
& ( R @ T @ U ) )
=> ( R @ S @ U ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mtransitive) ).
thf(mtrue,definition,
( mtrue
= ( ^ [W: $i] : $true ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mtrue) ).
thf(mvalid,definition,
( mvalid
= ( ^ [Phi: $i > $o] :
! [W: $i] : ( Phi @ W ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid) ).
thf(mweakly_connected,definition,
( mweakly_connected
= ( ^ [R: $i > $i > $o] :
! [S: $i,T: $i,U: $i] :
( ( ( R @ S @ T )
& ( R @ S @ U ) )
=> ( ( R @ T @ U )
| ( T = U )
| ( R @ U @ T ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mweakly_connected) ).
thf(mweakly_dense,definition,
( mweakly_dense
= ( ^ [R: $i > $i > $o] :
! [S: $i,T: $i,U: $i] :
( ( R @ S @ T )
=> ? [U: $i] :
( ( R @ S @ U )
& ( R @ U @ T ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mweakly_dense) ).
thf(mweakly_directed,definition,
( mweakly_directed
= ( ^ [R: $i > $i > $o] :
! [S: $i,T: $i,U: $i] :
( ( ( R @ S @ T )
& ( R @ S @ U ) )
=> ? [V: $i] :
( ( R @ T @ V )
& ( R @ U @ V ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mweakly_directed) ).
thf(mxor,definition,
( mxor
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mequiv @ Phi @ Psi ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mxor) ).
thf(1,conjecture,
? [R: $i > $i > $o] :
~ ( mvalid @ ( mdia @ R @ mtrue ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
( ( ? [R: $i > $i > $o] :
~ ( mvalid @ ( mdia @ R @ mtrue ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ~ ? [R: $i > $i > $o] :
~ ( mvalid @ ( mdia @ R @ mtrue ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [R: $i > $i > $o] : ( mvalid @ ( mdia @ R @ mtrue ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[3]) ).
thf(5,plain,
( ( ! [R: $i > $i > $o] : ( mvalid @ ( mdia @ R @ mtrue ) ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(6,plain,
( ( ! [SX0: $i > $i > $o,SX1: $i] :
~ ! [SX2: $i] :
( ~ ( SX0 @ SX1 @ SX2 )
| ~ $true ) )
= $true ),
inference(unfold_def,[status(thm)],[5,mand,mbox,mcountersatisfiable,mdia,meq_ind,meq_prop,mequiv,meuclidean,mexists_ind,mexists_prop,mfalse,mforall_ind,mforall_prop,mfunctional,mimplied,mimplies,minvalid,mnot,mor,mpartially_functional,mreflexive,msatisfiable,mserial,msymmetric,mtransitive,mtrue,mvalid,mweakly_connected,mweakly_dense,mweakly_directed,mxor]) ).
thf(7,plain,
! [SV1: $i > $i > $o] :
( ( ! [SY0: $i] :
~ ! [SY1: $i] :
( ~ ( SV1 @ SY0 @ SY1 )
| ~ $true ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[6]) ).
thf(8,plain,
! [SV2: $i,SV1: $i > $i > $o] :
( ( ~ ! [SY2: $i] :
( ~ ( SV1 @ SV2 @ SY2 )
| ~ $true ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[7]) ).
thf(9,plain,
! [SV2: $i,SV1: $i > $i > $o] :
( ( ! [SY2: $i] :
( ~ ( SV1 @ SV2 @ SY2 )
| ~ $true ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[8]) ).
thf(10,plain,
! [SV2: $i,SV1: $i > $i > $o] :
( ( ~ ( SV1 @ SV2 @ ( sK1_SY2 @ SV2 @ SV1 ) )
| ~ $true )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[9]) ).
thf(11,plain,
! [SV2: $i,SV1: $i > $i > $o] :
( ( ~ ( SV1 @ SV2 @ ( sK1_SY2 @ SV2 @ SV1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[10]) ).
thf(13,plain,
! [SV2: $i,SV1: $i > $i > $o] :
( ( SV1 @ SV2 @ ( sK1_SY2 @ SV2 @ SV1 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[11]) ).
thf(16,plain,
$false = $true,
inference(prim_subst,[status(thm)],[13:[bind(SV1,$thf( ^ [SV6: $i] : ^ [SV7: $i] : $false ))]]) ).
thf(22,plain,
$false = $true,
inference(sim,[status(thm)],[16]) ).
thf(23,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SYO053^2 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n028.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 : Sat Jul 9 06:47:26 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: 5324
% 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:false,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.19/0.43
% 0.19/0.43 ********************************
% 0.19/0.43 * All subproblems solved! *
% 0.19/0.43 ********************************
% 0.19/0.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:0,ps:3,u:6,ude:false,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:22,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.19/0.43
% 0.19/0.43 %**** Beginning of derivation protocol ****
% 0.19/0.43 % SZS output start CNFRefutation
% See solution above
% 0.19/0.43
% 0.19/0.43 %**** End of derivation protocol ****
% 0.19/0.43 %**** no. of clauses in derivation: 15 ****
% 0.19/0.43 %**** clause counter: 22 ****
% 0.19/0.43
% 0.19/0.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:0,ps:3,u:6,ude:false,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:22,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------