TSTP Solution File: SEU595^2 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU595^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n010.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 03:42:53 EDT 2024
% Result : Theorem 2.92s 2.04s
% Output : Refutation 3.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 19 ( 6 unt; 7 typ; 2 def)
% Number of atoms : 26 ( 3 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 77 ( 7 ~; 2 |; 0 &; 60 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 6 ^ 22 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_type,type,
in: $i > $i > $o ).
thf(dsetconstr_type,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(dsetconstrER_type,type,
dsetconstrER: $o ).
thf(dsetconstrER_def,definition,
( dsetconstrER
= ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( B @ C ) ) ) ) ).
thf(binintersect_type,type,
binintersect: $i > $i > $i ).
thf(binintersect_def,definition,
( binintersect
= ( ^ [A: $i,B: $i] :
( dsetconstr @ A
@ ^ [C: $i] : ( in @ C @ B ) ) ) ) ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(1,conjecture,
( dsetconstrER
=> ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( binintersect @ A @ B ) )
=> ( in @ C @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectER) ).
thf(2,negated_conjecture,
~ ( dsetconstrER
=> ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( binintersect @ A @ B ) )
=> ( in @ C @ B ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( B @ C ) )
=> ! [A: $i,B: $i,C: $i] :
( ( in @ C
@ ( dsetconstr @ A
@ ^ [D: $i] : ( in @ D @ B ) ) )
=> ( in @ C @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
( in @ sk3
@ ( dsetconstr @ sk1
@ ^ [A: $i] : ( in @ A @ sk2 ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
! [C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ( B @ C ) ),
inference(cnf,[status(esa)],[3]) ).
thf(4,plain,
~ ( in @ sk3 @ sk2 ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
! [C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ( ( B @ C )
!= ( in @ sk3 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[6,4]) ).
thf(21,plain,
! [A: $i] :
~ ( in @ sk3
@ ( dsetconstr @ A
@ ^ [B: $i] : ( in @ B @ sk2 ) ) ),
inference(pre_uni,[status(thm)],[10:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : ( in @ D @ sk2 ) )),bind(C,$thf( sk3 ))]]) ).
thf(35,plain,
$false,
inference(rewrite,[status(thm)],[5,21]) ).
thf(36,plain,
$false,
inference(simp,[status(thm)],[35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SEU595^2 : TPTP v8.2.0. Released v3.7.0.
% 0.05/0.14 % Command : run_Leo-III %s %d
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 16:18:54 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.91/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.15/1.01 % [INFO] Parsing done (154ms).
% 1.15/1.03 % [INFO] Running in sequential loop mode.
% 1.63/1.35 % [INFO] nitpick registered as external prover.
% 1.63/1.36 % [INFO] Scanning for conjecture ...
% 1.72/1.42 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.91/1.45 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.91/1.45 % [INFO] Problem is higher-order (TPTP THF).
% 1.91/1.45 % [INFO] Type checking passed.
% 1.91/1.45 % [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.92/2.04 % [INFO] Killing All external provers ...
% 2.92/2.04 % Time passed: 1558ms (effective reasoning time: 1004ms)
% 2.92/2.04 % 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.92/2.04 % Axioms used in derivation (0):
% 2.92/2.04 % No. of inferences in proof: 10
% 2.92/2.04 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1558 ms resp. 1004 ms w/o parsing
% 3.11/2.07 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.11/2.08 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------