TSTP Solution File: SYN918+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SYN918+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n011.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:01 EDT 2023
% Result : Theorem 2.67s 1.53s
% Output : Refutation 2.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 7 ( 1 unt; 3 typ; 0 def)
% Number of atoms : 46 ( 0 equ; 0 cnn)
% Maximal formula atoms : 15 ( 11 avg)
% Number of connectives : 95 ( 8 ~; 3 |; 18 &; 45 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 18 ( 0 ^; 12 !; 6 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_type,type,
f: $i > $o ).
thf(g_type,type,
g: $i > $o ).
thf(h_type,type,
h: $i > $o ).
thf(1,conjecture,
( ( ! [A: $i] :
( ( ( ( f @ A )
& ( g @ A ) )
=> ( h @ A ) )
=> ? [B: $i] :
( ( f @ B )
& ~ ( g @ B ) ) )
& ( ! [A: $i] :
( ( f @ A )
=> ( g @ A ) )
| ! [A: $i] :
( ( f @ A )
=> ( h @ A ) ) ) )
=> ( ! [A: $i] :
( ( ( f @ A )
& ( h @ A ) )
=> ( g @ A ) )
=> ? [A: $i] :
( ( f @ A )
& ( g @ A )
& ~ ( h @ A ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
~ ( ( ! [A: $i] :
( ( ( ( f @ A )
& ( g @ A ) )
=> ( h @ A ) )
=> ? [B: $i] :
( ( f @ B )
& ~ ( g @ B ) ) )
& ( ! [A: $i] :
( ( f @ A )
=> ( g @ A ) )
| ! [A: $i] :
( ( f @ A )
=> ( h @ A ) ) ) )
=> ( ! [A: $i] :
( ( ( f @ A )
& ( h @ A ) )
=> ( g @ A ) )
=> ? [A: $i] :
( ( f @ A )
& ( g @ A )
& ~ ( h @ A ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ! [A: $i] :
( ( ( ( f @ A )
& ( g @ A ) )
=> ( h @ A ) )
=> ? [B: $i] :
( ( f @ B )
& ~ ( g @ B ) ) )
& ( ! [A: $i] :
( ( f @ A )
=> ( g @ A ) )
| ! [A: $i] :
( ( f @ A )
=> ( h @ A ) ) ) )
=> ( ! [A: $i] :
( ( ( f @ A )
& ( h @ A ) )
=> ( g @ A ) )
=> ? [A: $i] :
( ( f @ A )
& ( g @ A )
& ~ ( h @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(23,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN918+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.15 % Command : run_Leo-III %s %d
% 0.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu May 18 19:33:34 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.86/0.84 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.19/0.95 % [INFO] Parsing done (104ms).
% 1.19/0.95 % [INFO] Running in sequential loop mode.
% 1.49/1.14 % [INFO] eprover registered as external prover.
% 1.49/1.15 % [INFO] cvc4 registered as external prover.
% 1.49/1.15 % [INFO] Scanning for conjecture ...
% 1.74/1.20 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.84/1.22 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.84/1.22 % [INFO] Problem is first-order (TPTP FOF).
% 1.84/1.23 % [INFO] Type checking passed.
% 1.86/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.67/1.52 % External prover 'e' found a proof!
% 2.67/1.52 % [INFO] Killing All external provers ...
% 2.67/1.52 % Time passed: 1004ms (effective reasoning time: 569ms)
% 2.67/1.52 % 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.67/1.53 % Axioms used in derivation (0):
% 2.67/1.53 % No. of inferences in proof: 4
% 2.67/1.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1004 ms resp. 569 ms w/o parsing
% 2.69/1.58 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.69/1.58 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------