TSTP Solution File: DAT334_8 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : DAT334_8 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n026.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 10:30:27 EDT 2024
% Result : Theorem 4.86s 2.66s
% Output : Refutation 4.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of formulae : 30 ( 6 unt; 13 typ; 0 def)
% Number of atoms : 45 ( 3 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 141 ( 14 ~; 6 |; 11 &; 105 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 10 con; 0-3 aty)
% Number of variables : 16 ( 0 ^ 11 !; 5 ?; 16 :)
% 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(sk1_type,type,
sk1: '\'$ki_world\'' ).
thf(sk3_type,type,
sk3: '\'$ki_world\'' > $i ).
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(16,plain,
! [A: '\'$ki_world\''] :
( ~ ( '\'$ki_accessible\'' @ '\'$ki_local_world\'' @ A )
| ( '\'$ki_exists_in_world_$i\'' @ A @ ( sk3 @ A ) ) ),
inference(cnf,[status(esa)],[13]) ).
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(8,plain,
'\'$ki_accessible\'' @ '\'$ki_local_world\'' @ sk1,
inference(cnf,[status(esa)],[6]) ).
thf(15,plain,
! [A: '\'$ki_world\''] :
( ~ ( '\'$ki_accessible\'' @ '\'$ki_local_world\'' @ A )
| ( teach @ A @ ( sk3 @ A ) @ cs ) ),
inference(cnf,[status(esa)],[13]) ).
thf(47,plain,
! [A: '\'$ki_world\''] :
( ( teach @ A @ ( sk3 @ A ) @ cs )
| ( ( '\'$ki_accessible\'' @ '\'$ki_local_world\'' @ sk1 )
!= ( '\'$ki_accessible\'' @ '\'$ki_local_world\'' @ A ) ) ),
inference(paramod_ordered,[status(thm)],[8,15]) ).
thf(48,plain,
teach @ sk1 @ ( sk3 @ sk1 ) @ cs,
inference(pattern_uni,[status(thm)],[47:[bind(A,$thf( sk1 ))]]) ).
thf(7,plain,
! [A: $i] :
( ~ ( '\'$ki_exists_in_world_$i\'' @ sk1 @ A )
| ~ ( teach @ sk1 @ A @ cs ) ),
inference(cnf,[status(esa)],[6]) ).
thf(58,plain,
! [A: $i] :
( ~ ( '\'$ki_exists_in_world_$i\'' @ sk1 @ A )
| ( ( teach @ sk1 @ ( sk3 @ sk1 ) @ cs )
!= ( teach @ sk1 @ A @ cs ) ) ),
inference(paramod_ordered,[status(thm)],[48,7]) ).
thf(59,plain,
~ ( '\'$ki_exists_in_world_$i\'' @ sk1 @ ( sk3 @ sk1 ) ),
inference(pattern_uni,[status(thm)],[58:[bind(A,$thf( sk3 @ sk1 ))]]) ).
thf(89,plain,
! [A: '\'$ki_world\''] :
( ~ ( '\'$ki_accessible\'' @ '\'$ki_local_world\'' @ A )
| ( ( '\'$ki_exists_in_world_$i\'' @ A @ ( sk3 @ A ) )
!= ( '\'$ki_exists_in_world_$i\'' @ sk1 @ ( sk3 @ sk1 ) ) ) ),
inference(paramod_ordered,[status(thm)],[16,59]) ).
thf(90,plain,
~ ( '\'$ki_accessible\'' @ '\'$ki_local_world\'' @ sk1 ),
inference(pattern_uni,[status(thm)],[89:[bind(A,$thf( sk1 ))]]) ).
thf(95,plain,
~ $true,
inference(rewrite,[status(thm)],[90,8]) ).
thf(96,plain,
$false,
inference(simp,[status(thm)],[95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : DAT334_8 : TPTP v8.2.0. Released v8.2.0.
% 0.08/0.12 % Command : run_Leo-III %s %d
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 6 18:42:53 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.99/0.97 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.23/1.18 % [INFO] Parsing done (209ms).
% 1.41/1.20 % [INFO] Running in sequential loop mode.
% 1.96/1.54 % [INFO] nitpick registered as external prover.
% 1.96/1.55 % [INFO] Scanning for conjecture ...
% 2.16/1.65 % [INFO] Found a conjecture and 3 axioms. Running axiom selection ...
% 2.29/1.69 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 2.29/1.71 % [INFO] Problem is typed first-order (TPTP TFF).
% 2.29/1.71 % [INFO] Type checking passed.
% 2.29/1.72 % [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 ...
% 4.86/2.66 % [INFO] Killing All external provers ...
% 4.86/2.66 % Time passed: 2181ms (effective reasoning time: 1458ms)
% 4.86/2.66 % 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)>
% 4.86/2.66 % Axioms used in derivation (1): db
% 4.86/2.66 % No. of inferences in proof: 17
% 4.86/2.66 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2181 ms resp. 1458 ms w/o parsing
% 4.86/2.71 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.86/2.71 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------