TSTP Solution File: DAT334_19 by Leo-III---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.10
% Problem : DAT334_19 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n019.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 : 300s
% DateTime : Tue May 7 07:39:59 EDT 2024
% Result : Theorem 2.68s 1.54s
% Output : Refutation 2.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 15
% Syntax : Number of formulae : 21 ( 3 unt; 11 typ; 0 def)
% Number of atoms : 30 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 91 ( 2 ~; 0 |; 13 &; 69 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 7 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 20 ( 0 ^ 13 !; 7 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf('\'$ki_world\'_type',type,
'\'$ki_world\'': $tType ).
thf('\'$ki_local_world\'_type',type,
'\'$ki_local_world\'': '\'$ki_world\'' ).
thf('\'$ki_accessible\'_type',type,
'\'$ki_accessible\'': '\'$ki_world\'' > '\'$ki_world\'' > $o ).
thf(cs_type,type,
cs: $i ).
thf(sue_type,type,
sue: $i ).
thf(mary_type,type,
mary: $i ).
thf(john_type,type,
john: $i ).
thf(math_type,type,
math: $i ).
thf(psych_type,type,
psych: $i ).
thf(teach_type,type,
teach: '\'$ki_world\'' > $i > $i > $o ).
thf('\'$ki_exists_in_world_$i\'_type',type,
'\'$ki_exists_in_world_$i\'': '\'$ki_world\'' > $i > $o ).
thf(1,conjecture,
! [A: '\'$ki_world\''] :
( ( '\'$ki_accessible\'' @ '\'$ki_local_world\'' @ A )
=> ? [B: $i] :
( ( '\'$ki_exists_in_world_$i\'' @ A @ B )
& ( teach @ A @ B @ cs ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
thf(2,negated_conjecture,
~ ! [A: '\'$ki_world\''] :
( ( '\'$ki_accessible\'' @ '\'$ki_local_world\'' @ A )
=> ? [B: $i] :
( ( '\'$ki_exists_in_world_$i\'' @ A @ B )
& ( teach @ A @ B @ cs ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ! [A: '\'$ki_world\''] :
( ( '\'$ki_accessible\'' @ '\'$ki_local_world\'' @ A )
=> ? [B: $i] :
( ( '\'$ki_exists_in_world_$i\'' @ A @ B )
& ( teach @ A @ B @ cs ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: '\'$ki_world\'',B: '\'$ki_world\'',C: $i] :
( ( ( '\'$ki_exists_in_world_$i\'' @ A @ C )
& ( '\'$ki_accessible\'' @ B @ A ) )
=> ( '\'$ki_exists_in_world_$i\'' @ B @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_decr') ).
thf(9,plain,
! [A: '\'$ki_world\'',B: '\'$ki_world\'',C: $i] :
( ( ( '\'$ki_exists_in_world_$i\'' @ A @ C )
& ( '\'$ki_accessible\'' @ B @ A ) )
=> ( '\'$ki_exists_in_world_$i\'' @ B @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: '\'$ki_world\''] :
? [B: $i] : ( '\'$ki_exists_in_world_$i\'' @ A @ B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_nonempty') ).
thf(11,plain,
! [A: '\'$ki_world\''] :
? [B: $i] : ( '\'$ki_exists_in_world_$i\'' @ A @ B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(5,axiom,
! [A: '\'$ki_world\''] :
( ( '\'$ki_accessible\'' @ '\'$ki_local_world\'' @ A )
=> ( ( teach @ A @ john @ math )
& ? [B: $i] :
( ( '\'$ki_exists_in_world_$i\'' @ A @ B )
& ( teach @ A @ B @ cs ) )
& ( teach @ A @ mary @ psych )
& ( teach @ A @ sue @ psych ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',db) ).
thf(13,plain,
! [A: '\'$ki_world\''] :
( ( '\'$ki_accessible\'' @ '\'$ki_local_world\'' @ A )
=> ( ( teach @ A @ john @ math )
& ? [B: $i] :
( ( '\'$ki_exists_in_world_$i\'' @ A @ B )
& ( teach @ A @ B @ cs ) )
& ( teach @ A @ mary @ psych )
& ( teach @ A @ sue @ psych ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(19,plain,
$false,
inference(e,[status(thm)],[6,9,11,13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT334_19 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n019.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 6 11:35:09 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.97/0.86 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.18/0.97 % [INFO] Parsing done (110ms).
% 1.18/0.98 % [INFO] Running in sequential loop mode.
% 1.68/1.17 % [INFO] eprover registered as external prover.
% 1.68/1.17 % [INFO] cvc4 registered as external prover.
% 1.68/1.18 % [INFO] Scanning for conjecture ...
% 1.68/1.23 % [INFO] Found a conjecture and 3 axioms. Running axiom selection ...
% 1.84/1.26 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 1.97/1.27 % [INFO] Problem is typed first-order (TPTP TFF).
% 1.97/1.27 % [INFO] Type checking passed.
% 1.97/1.27 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 2.68/1.53 % External prover 'e' found a proof!
% 2.68/1.53 % [INFO] Killing All external provers ...
% 2.68/1.54 % Time passed: 1005ms (effective reasoning time: 555ms)
% 2.68/1.54 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.68/1.54 % Axioms used in derivation (3): $ki_exists_in_world_$i_decr, $ki_exists_in_world_$i_nonempty, db
% 2.68/1.54 % No. of inferences in proof: 10
% 2.68/1.54 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1005 ms resp. 555 ms w/o parsing
% 2.68/1.56 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.68/1.56 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------