TSTP Solution File: SYN384+1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYN384+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n013.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:19 EDT 2024
% Result : Theorem 3.22s 2.26s
% Output : Refutation 3.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 5 unt; 3 typ; 0 def)
% Number of atoms : 15 ( 1 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 52 ( 6 ~; 0 |; 0 &; 42 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 7 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-3 aty)
% Number of variables : 24 ( 0 ^ 16 !; 8 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(big_p_type,type,
big_p: $i > $i > $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i > $i ).
thf(1,conjecture,
! [A: $i] :
? [B: $i,C: $i] :
! [D: $i] :
( ( big_p @ B @ C @ A )
=> ( big_p @ D @ B @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2136) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
? [B: $i,C: $i] :
! [D: $i] :
( ( big_p @ B @ C @ A )
=> ( big_p @ D @ B @ B ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i] :
? [B: $i,C: $i] :
! [D: $i] :
( ( big_p @ B @ C @ A )
=> ( big_p @ D @ B @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ( ? [A: $i] :
! [B: $i,C: $i] : ( big_p @ B @ C @ A )
=> ? [A: $i] :
! [B: $i] : ( big_p @ B @ A @ A ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(6,plain,
! [B: $i,A: $i] : ( big_p @ A @ B @ sk1 ),
inference(cnf,[status(esa)],[4]) ).
thf(5,plain,
! [A: $i] :
~ ( big_p @ ( sk2 @ A ) @ A @ A ),
inference(cnf,[status(esa)],[4]) ).
thf(7,plain,
! [A: $i] :
~ ( big_p @ ( sk2 @ A ) @ A @ A ),
inference(simp,[status(thm)],[5]) ).
thf(8,plain,
! [C: $i,B: $i,A: $i] :
( ( big_p @ A @ B @ sk1 )
!= ( big_p @ ( sk2 @ C ) @ C @ C ) ),
inference(paramod_ordered,[status(thm)],[6,7]) ).
thf(9,plain,
$false,
inference(pattern_uni,[status(thm)],[8:[bind(A,$thf( sk2 @ sk1 )),bind(B,$thf( sk1 )),bind(C,$thf( sk1 ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SYN384+1 : TPTP v8.2.0. Released v2.0.0.
% 0.05/0.13 % Command : run_Leo-III %s %d
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 13:51:24 EDT 2024
% 0.14/0.34 % CPUTime :
% 1.17/1.06 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.34/1.22 % [INFO] Parsing done (157ms).
% 1.52/1.24 % [INFO] Running in sequential loop mode.
% 2.13/1.66 % [INFO] nitpick registered as external prover.
% 2.13/1.67 % [INFO] Scanning for conjecture ...
% 2.32/1.76 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.32/1.79 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.32/1.80 % [INFO] Problem is first-order (TPTP FOF).
% 2.32/1.80 % [INFO] Type checking passed.
% 2.32/1.81 % [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 ...
% 3.10/2.25 % [INFO] Killing All external provers ...
% 3.22/2.26 % Time passed: 1753ms (effective reasoning time: 1014ms)
% 3.22/2.26 % 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)>
% 3.22/2.26 % Axioms used in derivation (0):
% 3.22/2.26 % No. of inferences in proof: 9
% 3.22/2.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1753 ms resp. 1014 ms w/o parsing
% 3.41/2.34 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.41/2.34 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------