TSTP Solution File: SYN336+1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYN336+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n025.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 : Tue May 21 08:18:05 EDT 2024
% Result : Theorem 2.56s 1.61s
% Output : Refutation 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 10 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 21 ( 1 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 58 ( 4 ~; 0 |; 0 &; 42 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 0 ^ 12 !; 6 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(big_f_type,type,
big_f: $i > $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i > $i > $i ).
thf(1,conjecture,
! [A: $i] :
? [B: $i,C: $i] :
! [D: $i] :
( ( big_f @ A @ D )
=> ( ( big_f @ B @ D )
=> ( ( big_f @ C @ D )
=> ( ( big_f @ B @ A )
=> ( big_f @ D @ C ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_15_1) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
? [B: $i,C: $i] :
! [D: $i] :
( ( big_f @ A @ D )
=> ( ( big_f @ B @ D )
=> ( ( big_f @ C @ D )
=> ( ( big_f @ B @ A )
=> ( big_f @ D @ C ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i] :
? [B: $i,C: $i] :
! [D: $i] :
( ( big_f @ A @ D )
=> ( ( big_f @ B @ D )
=> ( ( big_f @ C @ D )
=> ( ( big_f @ B @ A )
=> ( big_f @ D @ C ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(8,plain,
! [A: $i] : ( big_f @ A @ sk1 ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
! [B: $i,A: $i] :
~ ( big_f @ ( sk2 @ B @ A ) @ B ),
inference(cnf,[status(esa)],[3]) ).
thf(11,plain,
! [C: $i,B: $i,A: $i] :
( ( big_f @ A @ sk1 )
!= ( big_f @ ( sk2 @ C @ B ) @ C ) ),
inference(paramod_ordered,[status(thm)],[8,6]) ).
thf(12,plain,
$false,
inference(pattern_uni,[status(thm)],[11:[bind(A,$thf( sk2 @ sk1 @ E )),bind(B,$thf( E )),bind(C,$thf( sk1 ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN336+1 : TPTP v8.2.0. Released v2.0.0.
% 0.07/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n025.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 14:53:24 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.99/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.17/0.96 % [INFO] Parsing done (93ms).
% 1.17/0.96 % [INFO] Running in sequential loop mode.
% 1.41/1.17 % [INFO] nitpick registered as external prover.
% 1.41/1.18 % [INFO] Scanning for conjecture ...
% 1.72/1.23 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.72/1.25 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.72/1.25 % [INFO] Problem is first-order (TPTP FOF).
% 1.83/1.25 % [INFO] Type checking passed.
% 1.83/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.56/1.56 % [INFO] Killing All external provers ...
% 2.56/1.61 % Time passed: 1082ms (effective reasoning time: 640ms)
% 2.56/1.61 % 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.56/1.61 % Axioms used in derivation (0):
% 2.56/1.61 % No. of inferences in proof: 7
% 2.56/1.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1082 ms resp. 640 ms w/o parsing
% 2.56/1.63 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.56/1.63 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------