TSTP Solution File: SYN951+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SYN951+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n009.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 : Fri May 19 12:33:05 EDT 2023
% Result : Theorem 2.03s 1.32s
% Output : Refutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 8 ( 2 unt; 4 typ; 0 def)
% Number of atoms : 16 ( 0 equ; 0 cnn)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 20 ( 4 ~; 2 |; 4 &; 4 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 5 con; 0-1 aty)
% Number of variables : 4 ( 0 ^; 0 !; 4 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(p_type,type,
p: $i > $o ).
thf(a_type,type,
a: $o ).
thf(b_type,type,
b: $o ).
thf(q_type,type,
q: $o ).
thf(1,conjecture,
( ? [A: $i] : ( p @ A )
=> ( ? [A: $i] : ( p @ A )
& ( a
=> ( ( b
| ~ b )
& ( q
=> q ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
~ ( ? [A: $i] : ( p @ A )
=> ( ? [A: $i] : ( p @ A )
& ( a
=> ( ( b
| ~ b )
& ( q
=> q ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ $true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
$false,
inference(simp,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN951+1 : TPTP v8.1.2. Released v3.1.0.
% 0.15/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n009.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu May 18 19:20:49 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.95/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.23/0.97 % [INFO] Parsing done (103ms).
% 1.23/0.98 % [INFO] Running in sequential loop mode.
% 1.63/1.16 % [INFO] eprover registered as external prover.
% 1.63/1.16 % [INFO] cvc4 registered as external prover.
% 1.63/1.17 % [INFO] Scanning for conjecture ...
% 1.74/1.21 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.74/1.23 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.74/1.23 % [INFO] Problem is first-order (TPTP FOF).
% 1.84/1.23 % [INFO] Type checking passed.
% 1.84/1.23 % [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.03/1.31 % [INFO] Killing All external provers ...
% 2.03/1.31 % Time passed: 773ms (effective reasoning time: 335ms)
% 2.03/1.31 % 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.03/1.32 % Axioms used in derivation (0):
% 2.03/1.32 % No. of inferences in proof: 4
% 2.03/1.32 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 773 ms resp. 335 ms w/o parsing
% 2.03/1.34 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.03/1.34 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------