TSTP Solution File: SEU650^2 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SEU650^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n002.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:38:50 EDT 2024
% Result : Theorem 2.80s 1.72s
% Output : Refutation 2.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 8 ( 2 unt; 3 typ; 1 def)
% Number of atoms : 15 ( 11 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 64 ( 2 ~; 0 |; 0 &; 54 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 0 ^ 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(emptyset_type,type,
emptyset: $i ).
thf(setadjoin_type,type,
setadjoin: $i > $i > $i ).
thf(setukpairinjR11_type,type,
setukpairinjR11: $o ).
thf(setukpairinjR11_def,definition,
( setukpairinjR11
= ( ! [A: $i,B: $i] :
( ( A = B )
=> ( ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) )
= ( setadjoin @ A @ emptyset ) ) ) ) ) ).
thf(1,conjecture,
( setukpairinjR11
=> ! [A: $i,B: $i] :
( ( A = B )
=> ( ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ A @ emptyset ) @ emptyset ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjR12) ).
thf(2,negated_conjecture,
~ ( setukpairinjR11
=> ! [A: $i,B: $i] :
( ( A = B )
=> ( ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ A @ emptyset ) @ emptyset ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i] :
( ( A = B )
=> ( ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) )
= ( setadjoin @ A @ emptyset ) ) )
=> ! [A: $i,B: $i] :
( ( A = B )
=> ( ( setadjoin @ ( setadjoin @ A @ emptyset ) @ ( setadjoin @ ( setadjoin @ A @ ( setadjoin @ B @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ A @ emptyset ) @ emptyset ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(14,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU650^2 : TPTP v8.2.0. Released v3.7.0.
% 0.06/0.14 % Command : run_Leo-III %s %d
% 0.13/0.34 % Computer : n002.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 18:00:39 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.83/0.77 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.04/0.91 % [INFO] Parsing done (132ms).
% 1.04/0.92 % [INFO] Running in sequential loop mode.
% 1.50/1.22 % [INFO] eprover registered as external prover.
% 1.50/1.23 % [INFO] cvc4 registered as external prover.
% 1.50/1.23 % [INFO] Scanning for conjecture ...
% 1.72/1.30 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.72/1.32 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.72/1.32 % [INFO] Problem is higher-order (TPTP THF).
% 1.72/1.32 % [INFO] Type checking passed.
% 1.88/1.32 % [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.80/1.72 % External prover 'e' found a proof!
% 2.80/1.72 % [INFO] Killing All external provers ...
% 2.80/1.72 % Time passed: 1270ms (effective reasoning time: 791ms)
% 2.80/1.72 % 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.80/1.72 % Axioms used in derivation (0):
% 2.80/1.72 % No. of inferences in proof: 4
% 2.80/1.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1270 ms resp. 791 ms w/o parsing
% 2.94/1.76 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.94/1.76 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------