TSTP Solution File: QUA004^1 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : QUA004^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n028.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 : Mon Jun 24 13:52:25 EDT 2024
% Result : Theorem 4.39s 2.01s
% Output : Refutation 4.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 14
% Syntax : Number of formulae : 24 ( 24 unt; 0 typ; 6 def)
% Number of atoms : 52 ( 34 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 75 ( 2 ~; 1 |; 8 &; 64 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 46 ( 19 ^ 19 !; 8 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(emptyset_type,type,
emptyset: $i > $o ).
thf(emptyset_def,definition,
( emptyset
= ( ^ [A: $i] : $false ) ) ).
thf(singleton_type,type,
singleton: $i > $i > $o ).
thf(singleton_def,definition,
( singleton
= ( ^ [A: $i,B: $i] : ( B = A ) ) ) ).
thf(zero_type,type,
zero: $i ).
thf(sup_type,type,
sup: ( $i > $o ) > $i ).
thf(supset_type,type,
supset: ( ( $i > $o ) > $o ) > $i > $o ).
thf(supset_def,definition,
( supset
= ( ^ [A: ( $i > $o ) > $o,B: $i] :
? [C: $i > $o] :
( ( A @ C )
& ( ( sup @ C )
= B ) ) ) ) ).
thf(unionset_type,type,
unionset: ( ( $i > $o ) > $o ) > $i > $o ).
thf(unionset_def,definition,
( unionset
= ( ^ [A: ( $i > $o ) > $o,B: $i] :
? [C: $i > $o] :
( ( A @ C )
& ( C @ B ) ) ) ) ).
thf(addition_type,type,
addition: $i > $i > $i ).
thf(addition_def,definition,
( addition
= ( ^ [A: $i,B: $i] : ( sup @ ( union @ ( singleton @ A ) @ ( singleton @ B ) ) ) ) ) ).
thf(leq_type,type,
leq: $i > $i > $o ).
thf(multiplication_type,type,
multiplication: $i > $i > $i ).
thf(crossmult_type,type,
crossmult: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(crossmult_def,definition,
( crossmult
= ( ^ [A: $i > $o,B: $i > $o,C: $i] :
? [D: $i,E: $i] :
( ( A @ D )
& ( B @ E )
& ( C
= ( multiplication @ D @ E ) ) ) ) ) ).
thf(one_type,type,
one: $i ).
thf(1,conjecture,
! [A: $i] :
( ( addition @ A @ A )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addition_idemp) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
( ( addition @ A @ A )
= A ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(10,plain,
~ ! [A: $i] :
( ( sup
@ ^ [B: $i] : ( B = A ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,axiom,
! [A: $i > $o,B: $i > $o] :
( ( multiplication @ ( sup @ A ) @ ( sup @ B ) )
= ( sup @ ( crossmult @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplication_def) ).
thf(24,plain,
! [A: $i > $o,B: $i > $o] :
( ( multiplication @ ( sup @ A ) @ ( sup @ B ) )
= ( sup
@ ^ [C: $i] :
? [D: $i,E: $i] :
( ( A @ D )
& ( B @ E )
& ( C
= ( multiplication @ D @ E ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(6,axiom,
! [A: $i,B: $i] :
( ( leq @ A @ B )
= ( ( addition @ A @ B )
= B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order_def) ).
thf(21,plain,
! [A: $i,B: $i] :
( ( leq @ A @ B )
= ( ( sup
@ ^ [C: $i] :
( ( C = A )
| ( C = B ) ) )
= B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(3,axiom,
( ( sup @ emptyset )
= zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sup_es) ).
thf(13,plain,
( ( sup
@ ^ [A: $i] : $false )
= zero ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(8,axiom,
! [A: $i] :
( ( multiplication @ A @ one )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplication_neutral_right) ).
thf(27,plain,
! [A: $i] :
( ( multiplication @ A @ one )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(5,axiom,
! [A: ( $i > $o ) > $o] :
( ( sup @ ( supset @ A ) )
= ( sup @ ( unionset @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sup_set) ).
thf(18,plain,
! [A: ( $i > $o ) > $o] :
( ( sup
@ ^ [B: $i] :
? [C: $i > $o] :
( ( A @ C )
& ( ( sup @ C )
= B ) ) )
= ( sup
@ ^ [B: $i] :
? [C: $i > $o] :
( ( A @ C )
& ( C @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(9,axiom,
! [A: $i] :
( ( multiplication @ one @ A )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplication_neutral_left) ).
thf(30,plain,
! [A: $i] :
( ( multiplication @ one @ A )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(4,axiom,
! [A: $i] :
( ( sup @ ( singleton @ A ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sup_singleset) ).
thf(15,plain,
! [A: $i] :
( ( sup
@ ^ [B: $i] : ( B = A ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(33,plain,
$false,
inference(e,[status(thm)],[10,24,21,13,27,18,30,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : QUA004^1 : TPTP v8.2.0. Released v4.1.0.
% 0.11/0.12 % Command : run_Leo-III %s %d THM
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Jun 23 18:14:25 EDT 2024
% 0.12/0.33 % CPUTime :
% 1.02/0.90 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.33/1.03 % [INFO] Parsing done (130ms).
% 1.33/1.04 % [INFO] Running in sequential loop mode.
% 1.83/1.25 % [INFO] eprover registered as external prover.
% 1.83/1.25 % [INFO] Scanning for conjecture ...
% 2.08/1.32 % [INFO] Found a conjecture (or negated_conjecture) and 7 axioms. Running axiom selection ...
% 2.08/1.34 % [INFO] Axiom selection finished. Selected 7 axioms (removed 0 axioms).
% 2.08/1.35 % [INFO] Problem is higher-order (TPTP THF).
% 2.08/1.35 % [INFO] Type checking passed.
% 2.08/1.35 % [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.39/2.01 % External prover 'e' found a proof!
% 4.39/2.01 % [INFO] Killing All external provers ...
% 4.39/2.01 % Time passed: 1488ms (effective reasoning time: 970ms)
% 4.39/2.01 % 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.39/2.01 % Axioms used in derivation (7): multiplication_neutral_left, sup_es, sup_set, multiplication_def, multiplication_neutral_right, order_def, sup_singleset
% 4.39/2.01 % No. of inferences in proof: 18
% 4.39/2.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1488 ms resp. 970 ms w/o parsing
% 4.39/2.05 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.39/2.05 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------