TSTP Solution File: SYN353+1 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : SYN353+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n032.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 : Mon Jun 24 19:47:01 EDT 2024
% Result : Theorem 2.67s 1.69s
% Output : Refutation 2.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 77 ( 0 equ; 0 cnn)
% Maximal formula atoms : 36 ( 19 avg)
% Number of connectives : 307 ( 6 ~; 3 |; 20 &; 228 @)
% ( 8 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 14 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 2 ( 1 usr; 1 con; 0-3 aty)
% Number of variables : 15 ( 0 ^ 6 !; 9 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(big_f_type,type,
big_f: $i > $i > $i > $o ).
thf(1,conjecture,
! [A: $i] :
? [B: $i,C: $i,D: $i] :
! [E: $i] :
( ( ( big_f @ B @ C @ D )
=> ( ( big_f @ A @ A @ E )
=> ( ( big_f @ C @ D @ B )
| ( big_f @ D @ B @ C ) ) ) )
=> ( ( ( ( big_f @ D @ B @ C )
=> ( ( big_f @ B @ C @ D )
& ( big_f @ C @ D @ B ) ) )
<=> ( big_f @ C @ B @ E ) )
=> ( ( ( ( big_f @ C @ D @ B )
=> ( ( big_f @ B @ C @ D )
& ( big_f @ D @ B @ C ) ) )
<=> ( big_f @ B @ E @ C ) )
=> ( ( ( ( ( big_f @ D @ B @ C )
=> ~ ( big_f @ C @ D @ B ) )
=> ( big_f @ B @ C @ D ) )
<=> ( big_f @ E @ C @ B ) )
=> ( ( ( big_f @ B @ C @ D )
& ( big_f @ C @ D @ B )
& ( big_f @ D @ B @ C ) )
<=> ( big_f @ E @ E @ E ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_18_5) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
? [B: $i,C: $i,D: $i] :
! [E: $i] :
( ( ( big_f @ B @ C @ D )
=> ( ( big_f @ A @ A @ E )
=> ( ( big_f @ C @ D @ B )
| ( big_f @ D @ B @ C ) ) ) )
=> ( ( ( ( big_f @ D @ B @ C )
=> ( ( big_f @ B @ C @ D )
& ( big_f @ C @ D @ B ) ) )
<=> ( big_f @ C @ B @ E ) )
=> ( ( ( ( big_f @ C @ D @ B )
=> ( ( big_f @ B @ C @ D )
& ( big_f @ D @ B @ C ) ) )
<=> ( big_f @ B @ E @ C ) )
=> ( ( ( ( ( big_f @ D @ B @ C )
=> ~ ( big_f @ C @ D @ B ) )
=> ( big_f @ B @ C @ D ) )
<=> ( big_f @ E @ C @ B ) )
=> ( ( ( big_f @ B @ C @ D )
& ( big_f @ C @ D @ B )
& ( big_f @ D @ B @ C ) )
<=> ( big_f @ E @ E @ E ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i] :
? [B: $i,C: $i,D: $i] :
! [E: $i] :
( ( ( big_f @ B @ C @ D )
=> ( ( big_f @ A @ A @ E )
=> ( ( big_f @ C @ D @ B )
| ( big_f @ D @ B @ C ) ) ) )
=> ( ( ( ( ( big_f @ D @ B @ C )
=> ( ( big_f @ B @ C @ D )
& ( big_f @ C @ D @ B ) ) )
=> ( big_f @ C @ B @ E ) )
& ( ( big_f @ C @ B @ E )
=> ( ( big_f @ D @ B @ C )
=> ( ( big_f @ B @ C @ D )
& ( big_f @ C @ D @ B ) ) ) ) )
=> ( ( ( ( ( big_f @ C @ D @ B )
=> ( ( big_f @ B @ C @ D )
& ( big_f @ D @ B @ C ) ) )
=> ( big_f @ B @ E @ C ) )
& ( ( big_f @ B @ E @ C )
=> ( ( big_f @ C @ D @ B )
=> ( ( big_f @ B @ C @ D )
& ( big_f @ D @ B @ C ) ) ) ) )
=> ( ( ( ( ( ( big_f @ D @ B @ C )
=> ~ ( big_f @ C @ D @ B ) )
=> ( big_f @ B @ C @ D ) )
=> ( big_f @ E @ C @ B ) )
& ( ( big_f @ E @ C @ B )
=> ( ( ( big_f @ D @ B @ C )
=> ~ ( big_f @ C @ D @ B ) )
=> ( big_f @ B @ C @ D ) ) ) )
=> ( ( ( ( big_f @ B @ C @ D )
& ( big_f @ C @ D @ B )
& ( big_f @ D @ B @ C ) )
=> ( big_f @ E @ E @ E ) )
& ( ( big_f @ E @ E @ E )
=> ( ( big_f @ B @ C @ D )
& ( big_f @ C @ D @ B )
& ( big_f @ D @ B @ C ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(27,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN353+1 : TPTP v8.2.0. Released v2.0.0.
% 0.00/0.09 % Command : run_Leo-III %s %d THM
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Sun Jun 23 19:01:10 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.81/0.80 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.09/0.91 % [INFO] Parsing done (115ms).
% 1.09/0.92 % [INFO] Running in sequential loop mode.
% 1.33/1.17 % [INFO] eprover registered as external prover.
% 1.33/1.18 % [INFO] Scanning for conjecture ...
% 1.66/1.25 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.66/1.28 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.66/1.28 % [INFO] Problem is first-order (TPTP FOF).
% 1.66/1.28 % [INFO] Type checking passed.
% 1.66/1.28 % [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.69 % External prover 'e' found a proof!
% 2.67/1.69 % [INFO] Killing All external provers ...
% 2.67/1.69 % Time passed: 1264ms (effective reasoning time: 763ms)
% 2.67/1.69 % 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.69 % Axioms used in derivation (0):
% 2.67/1.69 % No. of inferences in proof: 4
% 2.67/1.69 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1264 ms resp. 763 ms w/o parsing
% 2.86/1.72 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.86/1.72 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------