%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO991_1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 09:45:53 AM UTC 2026
% Result : Theorem 3.61s 2.40s
% Output : Refutation 3.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 35 ( 2 equ; 0 cnn)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 93 ( 2 ~; 0 |; 14 &; 64 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 8 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 0 ^; 14 !; 16 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf('$world_type',type,
'$world': $tType ).
thf('$local_world_decl',type,
'$local_world': '$world' ).
thf('$accessible_world_decl',type,
'$accessible_world': '$world' > '$world' > $o ).
thf(p_decl,type,
p: '$world' > $i > $o ).
thf('$exists_in_world_$i_decl',type,
'$exists_in_world_$i': '$world' > $i > $o ).
thf(1,conjecture,
( ! [A: '$world'] :
( ( A @ ( '$local_world' @ '$accessible_world' ) )
=> ? [B: $i] :
( ? [C: '$world'] :
( ( B @ ( C @ p ) )
& ( C @ ( A @ '$accessible_world' ) ) )
& ( B @ ( A @ '$exists_in_world_$i' ) ) ) )
=> ! [A: '$world'] :
( ( A @ ( '$local_world' @ '$accessible_world' ) )
=> ? [B: '$world'] :
( ? [C: $i] :
( ( C @ ( B @ p ) )
& ( C @ ( B @ '$exists_in_world_$i' ) ) )
& ( B @ ( A @ '$accessible_world' ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',example) ).
thf(2,negated_conjecture,
~ ( ! [A: '$world'] :
( ( A @ ( '$local_world' @ '$accessible_world' ) )
=> ? [B: $i] :
( ? [C: '$world'] :
( ( B @ ( C @ p ) )
& ( C @ ( A @ '$accessible_world' ) ) )
& ( B @ ( A @ '$exists_in_world_$i' ) ) ) )
=> ! [A: '$world'] :
( ( A @ ( '$local_world' @ '$accessible_world' ) )
=> ? [B: '$world'] :
( ? [C: $i] :
( ( C @ ( B @ p ) )
& ( C @ ( B @ '$exists_in_world_$i' ) ) )
& ( B @ ( A @ '$accessible_world' ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ( ! [A: '$world'] :
( ( A @ ( '$local_world' @ '$accessible_world' ) )
=> ? [B: $i] :
( ? [C: '$world'] :
( ( B @ ( C @ p ) )
& ( C @ ( A @ '$accessible_world' ) ) )
& ( B @ ( A @ '$exists_in_world_$i' ) ) ) )
=> ! [A: '$world'] :
( ( A @ ( '$local_world' @ '$accessible_world' ) )
=> ? [B: '$world'] :
( ? [C: $i] :
( ( C @ ( B @ p ) )
& ( C @ ( B @ '$exists_in_world_$i' ) ) )
& ( B @ ( A @ '$accessible_world' ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: '$world'] :
? [B: $i] : ( B @ ( A @ '$exists_in_world_$i' ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$exists_in_world_$i_nonempty') ).
thf(13,plain,
! [A: '$world'] :
? [B: $i] : ( B @ ( A @ '$exists_in_world_$i' ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: '$world',B: $i] :
( ( B @ ( A @ '$exists_in_world_$i' ) )
=> ! [C: '$world'] :
( ( C @ ( A @ '$accessible_world' ) )
=> ? [D: $i] :
( ( B = D )
& ( D @ ( C @ '$exists_in_world_$i' ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence) ).
thf(15,plain,
! [A: '$world',B: $i] :
( ( B @ ( A @ '$exists_in_world_$i' ) )
=> ! [C: '$world'] :
( ( C @ ( A @ '$accessible_world' ) )
=> ? [D: $i] :
( ( B = D )
& ( D @ ( C @ '$exists_in_world_$i' ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(20,plain,
$false,
inference(e,[status(thm)],[5,13,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO991_1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.14/0.40 % Computer : n026.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Sat Sep 26 20:23:40 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.41 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.89/1.00 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.30/1.18 % [INFO] Parsing done (179ms).
% 1.43/1.20 % [INFO] Input problem is non-classical (logic $modal). Running HOL transformation from semantics specification contained in the problem file ...
% 1.43/1.22 %%% First-order logic specification detected, trying modal-logic-to-TXF embedding (redirected from embedding '$$modal' to embedding '$$fomlModel' version 1.3.7) ... Use flag -p FORCE_HIGHERORDER if you want to have THF output instead.
% 1.59/1.34 % [INFO] Running in sequential loop mode.
% 2.22/1.71 % [INFO] eprover registered as external prover.
% 2.22/1.72 % [INFO] Scanning for conjecture ...
% 2.42/1.80 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 2.42/1.84 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 2.42/1.86 % [INFO] Problem is typed first-order (TPTP TFF).
% 2.42/1.86 % [INFO] Type checking passed.
% 2.42/1.87 % [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 ...
% 3.61/2.39 % External prover 'e' found a proof!
% 3.61/2.39 % [INFO] Killing All external provers ...
% 3.61/2.39 % Time passed: 1841ms (effective reasoning time: 1052ms)
% 3.61/2.39 % 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)>
% 3.61/2.39 % Axioms used in derivation (2): $exists_in_world_$i_nonempty, existence
% 3.61/2.39 % No. of inferences in proof: 8
% 3.61/2.40 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1841 ms resp. 1052 ms w/o parsing
% 3.85/2.43 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.85/2.43 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------