TSTP Solution File: LCL580^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : LCL580^1 : TPTP v8.1.0. Released v3.6.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n005.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 : Sun Jul 17 12:24:15 EDT 2022
% Result : Theorem 0.13s 0.34s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 39
% Syntax : Number of formulae : 51 ( 27 unt; 23 typ; 15 def)
% Number of atoms : 88 ( 26 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 71 ( 11 ~; 5 |; 2 &; 52 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 81 ( 81 >; 0 *; 0 +; 0 <<)
% Number of symbols : 25 ( 22 usr; 5 con; 0-3 aty)
% Number of variables : 41 ( 28 ^ 9 !; 4 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_individuals,type,
individuals: $tType ).
thf(tp_current_world,type,
current_world: $i ).
thf(tp_mall,type,
mall: ( individuals > $i > $o ) > $i > $o ).
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_mexists,type,
mexists: ( individuals > $i > $o ) > $i > $o ).
thf(tp_mfalse,type,
mfalse: $i > $o ).
thf(tp_miff,type,
miff: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_mimpl,type,
mimpl: ( $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_msatisfiable,type,
msatisfiable: ( $i > $o ) > $o ).
thf(tp_mtrue,type,
mtrue: $i > $o ).
thf(tp_mvalid,type,
mvalid: ( $i > $o ) > $o ).
thf(tp_prop_a,type,
prop_a: $i > $o ).
thf(tp_prop_b,type,
prop_b: $i > $o ).
thf(tp_prop_c,type,
prop_c: $i > $o ).
thf(tp_r,type,
r: $i > $i > $o ).
thf(tp_sK1_SX0,type,
sK1_SX0: $i ).
thf(tp_sK2_SY0,type,
sK2_SY0: $i ).
thf(mall,definition,
( mall
= ( ^ [P: individuals > $i > $o,W: $i] :
! [X: individuals] : ( P @ X @ W ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mall) ).
thf(mand,definition,
( mand
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
& ( Y @ U ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mand) ).
thf(mbox,definition,
( mbox
= ( ^ [R: $i > $i > $o,P: $i > $o,X: $i] :
! [Y: $i] :
( ( R @ X @ Y )
=> ( P @ Y ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox) ).
thf(mcountersatisfiable,definition,
( mcountersatisfiable
= ( ^ [P: $i > $o] :
? [W: $i] :
~ ( P @ W ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mcountersatisfiable) ).
thf(mdia,definition,
( mdia
= ( ^ [R: $i > $i > $o,P: $i > $o,X: $i] :
? [Y: $i] :
( ( R @ X @ Y )
& ( P @ Y ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mdia) ).
thf(mexists,definition,
( mexists
= ( ^ [P: individuals > $i > $o,W: $i] :
? [X: individuals] : ( P @ X @ W ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mexists) ).
thf(mfalse,definition,
( mfalse
= ( ^ [X: $i] : $false ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mfalse) ).
thf(miff,definition,
( miff
= ( ^ [U: $i > $o,V: $i > $o] : ( mand @ ( mimpl @ U @ V ) @ ( mimpl @ V @ U ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',miff) ).
thf(mimpl,definition,
( mimpl
= ( ^ [U: $i > $o,V: $i > $o] : ( mor @ ( mnot @ U ) @ V ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimpl) ).
thf(minvalid,definition,
( minvalid
= ( ^ [P: $i > $o] :
! [W: $i] :
~ ( P @ W ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',minvalid) ).
thf(mnot,definition,
( mnot
= ( ^ [X: $i > $o,U: $i] :
~ ( X @ U ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot) ).
thf(mor,definition,
( mor
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
| ( Y @ U ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor) ).
thf(msatisfiable,definition,
( msatisfiable
= ( ^ [P: $i > $o] :
? [W: $i] : ( P @ W ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',msatisfiable) ).
thf(mtrue,definition,
( mtrue
= ( ^ [X: $i] : $true ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mtrue) ).
thf(mvalid,definition,
( mvalid
= ( ^ [P: $i > $o] :
! [W: $i] : ( P @ W ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid) ).
thf(1,conjecture,
mvalid @ ( mbox @ r @ mtrue ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(2,negated_conjecture,
( ( mvalid @ ( mbox @ r @ mtrue ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ~ ( mvalid @ ( mbox @ r @ mtrue ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[2]) ).
thf(4,plain,
( ( ~ ( mvalid @ ( mbox @ r @ mtrue ) ) )
= $true ),
inference(copy,[status(thm)],[3]) ).
thf(5,plain,
( ( ~ ! [SX0: $i,SX1: $i] :
( ~ ( r @ SX0 @ SX1 )
| $true ) )
= $true ),
inference(unfold_def,[status(thm)],[4,mall,mand,mbox,mcountersatisfiable,mdia,mexists,mfalse,miff,mimpl,minvalid,mnot,mor,msatisfiable,mtrue,mvalid]) ).
thf(6,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( r @ SX0 @ SX1 )
| $true ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [SY0: $i] :
( ~ ( r @ sK1_SX0 @ SY0 )
| $true ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[6]) ).
thf(8,plain,
( ( ~ ( r @ sK1_SX0 @ sK2_SY0 )
| $true )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[7]) ).
thf(9,plain,
( ( ~ ( r @ sK1_SX0 @ sK2_SY0 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[8]) ).
thf(10,plain,
$true = $false,
inference(extcnf_or_neg,[status(thm)],[8]) ).
thf(11,plain,
( ( r @ sK1_SX0 @ sK2_SY0 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[9]) ).
thf(12,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[10,11]) ).
thf(13,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL580^1 : TPTP v8.1.0. Released v3.6.0.
% 0.03/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.32 % Computer : n005.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Mon Jul 4 12:22:52 EDT 2022
% 0.13/0.32 % CPUTime :
% 0.13/0.32
% 0.13/0.32 No.of.Axioms: 0
% 0.13/0.32
% 0.13/0.32 Length.of.Defs: 2203
% 0.13/0.32
% 0.13/0.32 Contains.Choice.Funs: false
% 0.13/0.32 (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.13/0.34 ********************************
% 0.13/0.34 * All subproblems solved! *
% 0.13/0.34 ********************************
% 0.13/0.34 % SZS status Theorem for /export/starexec/sandbox/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:12,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.34
% 0.13/0.34 %**** Beginning of derivation protocol ****
% 0.13/0.34 % SZS output start CNFRefutation
% See solution above
% 0.13/0.35
% 0.13/0.35 %**** End of derivation protocol ****
% 0.13/0.35 %**** no. of clauses in derivation: 13 ****
% 0.13/0.35 %**** clause counter: 12 ****
% 0.13/0.35
% 0.13/0.35 % SZS status Theorem for /export/starexec/sandbox/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:12,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------