TSTP Solution File: HEN003-2 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : HEN003-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n021.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 : Fri May 19 11:16:48 EDT 2023
% Result : Unsatisfiable 2.71s 1.54s
% Output : Refutation 2.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 18
% Syntax : Number of formulae : 31 ( 13 unt; 6 typ; 0 def)
% Number of atoms : 49 ( 4 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 170 ( 26 ~; 24 |; 0 &; 120 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 54 ( 0 ^; 54 !; 0 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
thf(quotient_type,type,
quotient: $i > $i > $i > $o ).
thf(x_type,type,
x: $i ).
thf(zero_type,type,
zero: $i ).
thf(less_equal_type,type,
less_equal: $i > $i > $o ).
thf(identity_type,type,
identity: $i ).
thf(divide_type,type,
divide: $i > $i > $i ).
thf(7,axiom,
! [B: $i,A: $i] :
( ~ ( less_equal @ A @ B )
| ~ ( less_equal @ B @ A )
| ( A = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_equal_and_equal) ).
thf(24,plain,
! [B: $i,A: $i] :
( ~ ( less_equal @ A @ B )
| ~ ( less_equal @ B @ A )
| ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(10,axiom,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( quotient @ A @ B @ C )
| ~ ( quotient @ A @ B @ D )
| ( C = D ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',well_defined) ).
thf(29,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( quotient @ A @ B @ C )
| ~ ( quotient @ A @ B @ D )
| ( C = D ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(1,negated_conjecture,
~ ( quotient @ x @ x @ zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_x_divide_x_is_zero) ).
thf(13,plain,
~ ( quotient @ x @ x @ zero ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(8,axiom,
! [A: $i] : ( less_equal @ A @ identity ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_is_largest) ).
thf(27,plain,
! [A: $i] : ( less_equal @ A @ identity ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(6,axiom,
! [A: $i] : ( less_equal @ zero @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_is_smallest) ).
thf(23,plain,
! [A: $i] : ( less_equal @ zero @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(4,axiom,
! [C: $i,B: $i,A: $i] :
( ~ ( quotient @ A @ B @ C )
| ( less_equal @ C @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor_existence) ).
thf(19,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( quotient @ A @ B @ C )
| ( less_equal @ C @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(2,axiom,
! [B: $i,A: $i] :
( ~ ( less_equal @ A @ B )
| ( quotient @ A @ B @ zero ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_less_equal) ).
thf(15,plain,
! [B: $i,A: $i] :
( ~ ( less_equal @ A @ B )
| ( quotient @ A @ B @ zero ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(9,axiom,
! [B: $i,A: $i] : ( quotient @ A @ B @ ( divide @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',closure) ).
thf(28,plain,
! [B: $i,A: $i] : ( quotient @ A @ B @ ( divide @ A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(5,axiom,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( quotient @ A @ B @ C )
| ~ ( quotient @ B @ D @ E )
| ~ ( quotient @ A @ D @ F )
| ~ ( quotient @ F @ E @ G )
| ~ ( quotient @ C @ D @ H )
| ( less_equal @ G @ H ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_property) ).
thf(21,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( quotient @ A @ B @ C )
| ~ ( quotient @ B @ D @ E )
| ~ ( quotient @ A @ D @ F )
| ~ ( quotient @ F @ E @ G )
| ~ ( quotient @ C @ D @ H )
| ( less_equal @ G @ H ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(12,axiom,
! [A: $i] : ( quotient @ zero @ A @ zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
thf(33,plain,
! [A: $i] : ( quotient @ zero @ A @ zero ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(11,axiom,
! [A: $i] : ( quotient @ A @ identity @ zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',everything_divide_identity_is_zero) ).
thf(32,plain,
! [A: $i] : ( quotient @ A @ identity @ zero ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(3,axiom,
! [B: $i,A: $i] :
( ~ ( quotient @ A @ B @ zero )
| ( less_equal @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_equal_quotient) ).
thf(17,plain,
! [B: $i,A: $i] :
( ~ ( quotient @ A @ B @ zero )
| ( less_equal @ A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(34,plain,
$false,
inference(e,[status(thm)],[24,29,13,27,23,19,15,28,21,33,32,17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : HEN003-2 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n021.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu May 18 15:14:43 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.90/0.83 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.20/0.94 % [INFO] Parsing done (112ms).
% 1.20/0.95 % [INFO] Running in sequential loop mode.
% 1.60/1.15 % [INFO] eprover registered as external prover.
% 1.60/1.15 % [INFO] cvc4 registered as external prover.
% 1.60/1.15 % [INFO] Scanning for conjecture ...
% 1.70/1.20 % [INFO] Found a conjecture and 11 axioms. Running axiom selection ...
% 1.70/1.22 % [INFO] Axiom selection finished. Selected 11 axioms (removed 0 axioms).
% 1.90/1.23 % [INFO] Problem is propositional (TPTP CNF).
% 1.90/1.24 % [INFO] Type checking passed.
% 1.90/1.24 % [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.71/1.53 % External prover 'e' found a proof!
% 2.71/1.54 % [INFO] Killing All external provers ...
% 2.71/1.54 % Time passed: 1025ms (effective reasoning time: 581ms)
% 2.71/1.54 % 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.71/1.54 % Axioms used in derivation (11): quotient_property, quotient_less_equal, closure, everything_divide_identity_is_zero, zero_divide_anything_is_zero, less_equal_and_equal, zero_is_smallest, less_equal_quotient, identity_is_largest, divisor_existence, well_defined
% 2.71/1.54 % No. of inferences in proof: 25
% 2.71/1.54 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1025 ms resp. 581 ms w/o parsing
% 2.82/1.56 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.82/1.56 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------