TSTP Solution File: SYN549+1 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SYN549+1 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n013.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 21 08:12:43 EDT 2024
% Result : Theorem 4.88s 2.82s
% Output : Refutation 4.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 12 ( 3 unt; 4 typ; 0 def)
% Number of atoms : 47 ( 0 equ; 0 cnn)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 117 ( 2 ~; 8 |; 22 &; 76 @)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 0 ^ 11 !; 19 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(reachable_type,type,
reachable: $i > $i > $o ).
thf(initial_world_type,type,
initial_world: $i ).
thf(p_type,type,
p: $i > $o ).
thf(q_type,type,
q: $i > $o ).
thf(1,conjecture,
? [A: $i] :
( ( reachable @ initial_world @ A )
& ! [B: $i] :
( ( reachable @ A @ B )
=> ( ? [C: $i] :
( ( reachable @ B @ C )
& ( ( p @ C )
| ? [D: $i] :
( ( reachable @ C @ D )
& ( q @ D ) ) ) )
<=> ( ? [C: $i] :
( ( reachable @ B @ C )
& ( p @ C ) )
| ? [C: $i] :
( ( reachable @ B @ C )
& ( q @ C ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
~ ? [A: $i] :
( ( reachable @ initial_world @ A )
& ! [B: $i] :
( ( reachable @ A @ B )
=> ( ? [C: $i] :
( ( reachable @ B @ C )
& ( ( p @ C )
| ? [D: $i] :
( ( reachable @ C @ D )
& ( q @ D ) ) ) )
<=> ( ? [C: $i] :
( ( reachable @ B @ C )
& ( p @ C ) )
| ? [C: $i] :
( ( reachable @ B @ C )
& ( q @ C ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ? [A: $i] :
( ( reachable @ initial_world @ A )
& ! [B: $i] :
( ( reachable @ A @ B )
=> ( ( ? [C: $i] :
( ( reachable @ B @ C )
& ( ( p @ C )
| ? [D: $i] :
( ( reachable @ C @ D )
& ( q @ D ) ) ) )
=> ( ? [C: $i] :
( ( reachable @ B @ C )
& ( p @ C ) )
| ? [C: $i] :
( ( reachable @ B @ C )
& ( q @ C ) ) ) )
& ( ( ? [C: $i] :
( ( reachable @ B @ C )
& ( p @ C ) )
| ? [C: $i] :
( ( reachable @ B @ C )
& ( q @ C ) ) )
=> ? [C: $i] :
( ( reachable @ B @ C )
& ( ( p @ C )
| ? [D: $i] :
( ( reachable @ C @ D )
& ( q @ D ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: $i] : ( reachable @ A @ A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_reachable) ).
thf(21,plain,
! [A: $i] : ( reachable @ A @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( reachable @ A @ B )
& ( reachable @ B @ C ) )
=> ( reachable @ A @ C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_reachable) ).
thf(23,plain,
! [A: $i,B: $i,C: $i] :
( ( ( reachable @ A @ B )
& ( reachable @ B @ C ) )
=> ( reachable @ A @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(29,plain,
$false,
inference(cvc4,[status(thm)],[5,21,23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN549+1 : TPTP v8.2.0. Released v2.2.0.
% 0.10/0.14 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 14:28:09 EDT 2024
% 0.14/0.35 % CPUTime :
% 1.19/1.16 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.66/1.34 % [INFO] Parsing done (183ms).
% 1.66/1.36 % [INFO] Running in sequential loop mode.
% 2.37/1.83 % [INFO] eprover registered as external prover.
% 2.37/1.83 % [INFO] cvc4 registered as external prover.
% 2.40/1.84 % [INFO] Scanning for conjecture ...
% 2.59/1.94 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 2.71/1.99 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 2.71/2.00 % [INFO] Problem is first-order (TPTP FOF).
% 2.71/2.01 % [INFO] Type checking passed.
% 2.71/2.01 % [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.88/2.82 % External prover 'cvc4' found a proof!
% 4.88/2.82 % [INFO] Killing All external provers ...
% 4.88/2.82 % Time passed: 2289ms (effective reasoning time: 1453ms)
% 4.88/2.82 % 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.88/2.82 % Axioms used in derivation (2): reflexivity_of_reachable, transitivity_of_reachable
% 4.88/2.82 % No. of inferences in proof: 8
% 4.88/2.82 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2289 ms resp. 1453 ms w/o parsing
% 4.88/2.87 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.88/2.88 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------