TSTP Solution File: SYN334+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SYN334+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n017.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:28:24 EDT 2023
% Result : Theorem 2.67s 1.55s
% Output : Refutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 6 ( 1 unt; 2 typ; 0 def)
% Number of atoms : 32 ( 0 equ; 0 cnn)
% Maximal formula atoms : 15 ( 8 avg)
% Number of connectives : 92 ( 2 ~; 0 |; 3 &; 62 @)
% ( 6 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 3 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 9 ( 0 ^; 3 !; 6 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
thf(big_f_type,type,
big_f: $i > $i > $o ).
thf(big_g_type,type,
big_g: $i > $i > $o ).
thf(1,conjecture,
? [A: $i,B: $i] :
! [C: $i] :
( ( ( big_f @ A @ B )
=> ( ( big_f @ A @ C )
<=> ( big_g @ B @ C ) ) )
=> ( ( ( big_f @ A @ B )
<=> ( ( big_f @ C @ C )
=> ( big_g @ C @ C ) ) )
=> ( ( big_g @ A @ B )
<=> ( big_g @ C @ C ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_14_6) ).
thf(2,negated_conjecture,
~ ? [A: $i,B: $i] :
! [C: $i] :
( ( ( big_f @ A @ B )
=> ( ( big_f @ A @ C )
<=> ( big_g @ B @ C ) ) )
=> ( ( ( big_f @ A @ B )
<=> ( ( big_f @ C @ C )
=> ( big_g @ C @ C ) ) )
=> ( ( big_g @ A @ B )
<=> ( big_g @ C @ C ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: $i,B: $i] :
! [C: $i] :
( ( ( big_f @ A @ B )
=> ( ( ( big_f @ A @ C )
=> ( big_g @ B @ C ) )
& ( ( big_g @ B @ C )
=> ( big_f @ A @ C ) ) ) )
=> ( ( ( ( big_f @ A @ B )
=> ( ( big_f @ C @ C )
=> ( big_g @ C @ C ) ) )
& ( ( ( big_f @ C @ C )
=> ( big_g @ C @ C ) )
=> ( big_f @ A @ B ) ) )
=> ( ( ( big_g @ A @ B )
=> ( big_g @ C @ C ) )
& ( ( big_g @ C @ C )
=> ( big_g @ A @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(18,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN334+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.15 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n017.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 : Thu May 18 19:02:31 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.94/0.85 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.17/0.95 % [INFO] Parsing done (106ms).
% 1.17/0.96 % [INFO] Running in sequential loop mode.
% 1.60/1.16 % [INFO] eprover registered as external prover.
% 1.60/1.17 % [INFO] cvc4 registered as external prover.
% 1.69/1.17 % [INFO] Scanning for conjecture ...
% 1.69/1.22 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.85/1.24 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.85/1.24 % [INFO] Problem is first-order (TPTP FOF).
% 1.85/1.25 % [INFO] Type checking passed.
% 1.85/1.25 % [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.55 % External prover 'e' found a proof!
% 2.67/1.55 % [INFO] Killing All external provers ...
% 2.67/1.55 % Time passed: 1026ms (effective reasoning time: 585ms)
% 2.67/1.55 % 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.55 % Axioms used in derivation (0):
% 2.67/1.55 % No. of inferences in proof: 4
% 2.67/1.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1026 ms resp. 585 ms w/o parsing
% 2.74/1.57 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.74/1.57 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------