TSTP Solution File: SYN340+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SYN340+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% 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 : Fri May 19 12:28:26 EDT 2023
% Result : Theorem 2.27s 1.45s
% Output : Refutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 5 unt; 2 typ; 0 def)
% Number of atoms : 15 ( 1 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 80 ( 6 ~; 0 |; 0 &; 70 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 1 con; 0-5 aty)
% Number of variables : 33 ( 0 ^; 21 !; 12 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(big_f_type,type,
big_f: $i > $i > $i > $i > $i > $o ).
thf(sk1_type,type,
sk1: $i > $i ).
thf(1,conjecture,
? [A: $i] :
! [B: $i] :
? [C: $i,D: $i] :
( ( big_f @ A @ B @ C @ D @ C )
=> ( big_f @ C @ A @ B @ C @ D ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_15_5) ).
thf(2,negated_conjecture,
~ ? [A: $i] :
! [B: $i] :
? [C: $i,D: $i] :
( ( big_f @ A @ B @ C @ D @ C )
=> ( big_f @ C @ A @ B @ C @ D ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: $i] :
! [B: $i] :
? [C: $i,D: $i] :
( ( big_f @ A @ B @ C @ D @ C )
=> ( big_f @ C @ A @ B @ C @ D ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ? [A: $i] :
! [B: $i] :
( ! [C: $i,D: $i] : ( big_f @ A @ B @ C @ D @ C )
=> ? [C: $i,D: $i] : ( big_f @ C @ A @ B @ C @ D ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(6,plain,
! [C: $i,B: $i,A: $i] : ( big_f @ A @ ( sk1 @ A ) @ B @ C @ B ),
inference(cnf,[status(esa)],[4]) ).
thf(5,plain,
! [C: $i,B: $i,A: $i] :
~ ( big_f @ B @ A @ ( sk1 @ A ) @ B @ C ),
inference(cnf,[status(esa)],[4]) ).
thf(7,plain,
! [C: $i,B: $i,A: $i] :
~ ( big_f @ B @ A @ ( sk1 @ A ) @ B @ C ),
inference(simp,[status(thm)],[5]) ).
thf(8,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( big_f @ A @ ( sk1 @ A ) @ B @ C @ B )
!= ( big_f @ E @ D @ ( sk1 @ D ) @ E @ F ) ),
inference(paramod_ordered,[status(thm)],[6,7]) ).
thf(9,plain,
$false,
inference(pattern_uni,[status(thm)],[8:[bind(A,$thf( K )),bind(B,$thf( sk1 @ ( sk1 @ K ) )),bind(C,$thf( K )),bind(D,$thf( sk1 @ K )),bind(E,$thf( K )),bind(F,$thf( sk1 @ ( sk1 @ K ) ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SYN340+1 : TPTP v8.1.2. Released v2.0.0.
% 0.09/0.11 % Command : run_Leo-III %s %d
% 0.11/0.29 % Computer : n032.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Thu May 18 19:24:35 EDT 2023
% 0.11/0.30 % CPUTime :
% 0.64/0.69 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.77/0.79 % [INFO] Parsing done (105ms).
% 1.01/0.80 % [INFO] Running in sequential loop mode.
% 1.22/1.01 % [INFO] eprover registered as external prover.
% 1.22/1.02 % [INFO] cvc4 registered as external prover.
% 1.41/1.02 % [INFO] Scanning for conjecture ...
% 1.41/1.07 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.41/1.09 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.41/1.09 % [INFO] Problem is first-order (TPTP FOF).
% 1.41/1.09 % [INFO] Type checking passed.
% 1.58/1.10 % [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.27/1.41 % [INFO] Killing All external provers ...
% 2.27/1.45 % Time passed: 1014ms (effective reasoning time: 607ms)
% 2.27/1.45 % 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.27/1.45 % Axioms used in derivation (0):
% 2.27/1.45 % No. of inferences in proof: 9
% 2.27/1.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1014 ms resp. 607 ms w/o parsing
% 2.48/1.48 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.48/1.48 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------