TSTP Solution File: SEU783^2 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU783^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n011.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:43:46 EDT 2024
% Result : Theorem 4.07s 2.62s
% Output : Refutation 4.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 20 ( 6 unt; 9 typ; 1 def)
% Number of atoms : 37 ( 2 equ; 0 cnn)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 128 ( 8 ~; 2 |; 0 &; 98 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 27 ( 0 ^ 27 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_type,type,
in: $i > $i > $o ).
thf(binunion_type,type,
binunion: $i > $i > $i ).
thf(binunionIL_type,type,
binunionIL: $o ).
thf(binunionIL_def,definition,
( binunionIL
= ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ A )
=> ( in @ C @ ( binunion @ A @ B ) ) ) ) ) ).
thf(kpair_type,type,
kpair: $i > $i > $i ).
thf(breln1_type,type,
breln1: $i > $i > $o ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(sk4_type,type,
sk4: $i ).
thf(sk5_type,type,
sk5: $i ).
thf(1,conjecture,
( binunionIL
=> ! [A: $i,B: $i] :
( ( breln1 @ A @ B )
=> ! [C: $i] :
( ( breln1 @ A @ C )
=> ! [D: $i] :
( ( in @ D @ A )
=> ! [E: $i] :
( ( in @ E @ A )
=> ( ( in @ ( kpair @ D @ E ) @ B )
=> ( in @ ( kpair @ D @ E ) @ ( binunion @ B @ C ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1unionIL) ).
thf(2,negated_conjecture,
~ ( binunionIL
=> ! [A: $i,B: $i] :
( ( breln1 @ A @ B )
=> ! [C: $i] :
( ( breln1 @ A @ C )
=> ! [D: $i] :
( ( in @ D @ A )
=> ! [E: $i] :
( ( in @ E @ A )
=> ( ( in @ ( kpair @ D @ E ) @ B )
=> ( in @ ( kpair @ D @ E ) @ ( binunion @ B @ C ) ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ A )
=> ( in @ C @ ( binunion @ A @ B ) ) )
=> ! [A: $i,B: $i] :
( ( breln1 @ A @ B )
=> ! [C: $i] :
( ( breln1 @ A @ C )
=> ! [D: $i] :
( ( in @ D @ A )
=> ! [E: $i] :
( ( in @ E @ A )
=> ( ( in @ ( kpair @ D @ E ) @ B )
=> ( in @ ( kpair @ D @ E ) @ ( binunion @ B @ C ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(9,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ C @ A )
| ( in @ C @ ( binunion @ A @ B ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
~ ( in @ ( kpair @ sk4 @ sk5 ) @ ( binunion @ sk2 @ sk3 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(18,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ C @ A )
| ( ( in @ C @ ( binunion @ A @ B ) )
!= ( in @ ( kpair @ sk4 @ sk5 ) @ ( binunion @ sk2 @ sk3 ) ) ) ),
inference(paramod_ordered,[status(thm)],[9,10]) ).
thf(19,plain,
~ ( in @ ( kpair @ sk4 @ sk5 ) @ sk2 ),
inference(pattern_uni,[status(thm)],[18:[bind(A,$thf( sk2 )),bind(B,$thf( sk3 )),bind(C,$thf( kpair @ sk4 @ sk5 ))]]) ).
thf(6,plain,
in @ ( kpair @ sk4 @ sk5 ) @ sk2,
inference(cnf,[status(esa)],[3]) ).
thf(32,plain,
~ $true,
inference(rewrite,[status(thm)],[19,6]) ).
thf(33,plain,
$false,
inference(simp,[status(thm)],[32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU783^2 : TPTP v8.2.0. Released v3.7.0.
% 0.10/0.14 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 16:40:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 1.19/1.10 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.48/1.29 % [INFO] Parsing done (184ms).
% 1.61/1.31 % [INFO] Running in sequential loop mode.
% 2.13/1.74 % [INFO] nitpick registered as external prover.
% 2.13/1.75 % [INFO] Scanning for conjecture ...
% 2.42/1.87 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.61/1.91 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.61/1.92 % [INFO] Problem is higher-order (TPTP THF).
% 2.61/1.92 % [INFO] Type checking passed.
% 2.61/1.93 % [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 ...
% 4.07/2.62 % [INFO] Killing All external provers ...
% 4.07/2.62 % Time passed: 2093ms (effective reasoning time: 1305ms)
% 4.07/2.62 % 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)>
% 4.07/2.62 % Axioms used in derivation (0):
% 4.07/2.62 % No. of inferences in proof: 10
% 4.07/2.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2093 ms resp. 1305 ms w/o parsing
% 4.07/2.67 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.07/2.67 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------