TSTP Solution File: GRP499-1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : GRP499-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n012.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:14:10 EDT 2023
% Result : Unsatisfiable 2.54s 1.56s
% Output : Refutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 8
% Syntax : Number of formulae : 12 ( 7 unt; 5 typ; 0 def)
% Number of atoms : 7 ( 6 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 54 ( 2 ~; 0 |; 0 &; 52 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 ^; 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(multiply_type,type,
multiply: $i > $i > $i ).
thf(inverse_type,type,
inverse: $i > $i ).
thf(a1_type,type,
a1: $i ).
thf(b1_type,type,
b1: $i ).
thf(double_divide_type,type,
double_divide: $i > $i > $i ).
thf(1,negated_conjecture,
( ( multiply @ ( inverse @ a1 ) @ a1 )
!= ( multiply @ ( inverse @ b1 ) @ b1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
thf(4,plain,
( ( multiply @ ( inverse @ a1 ) @ a1 )
!= ( multiply @ ( inverse @ b1 ) @ b1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(2,axiom,
! [D: $i,C: $i,B: $i,A: $i] :
( ( double_divide @ ( inverse @ A ) @ ( inverse @ ( double_divide @ ( inverse @ ( double_divide @ A @ ( double_divide @ B @ C ) ) ) @ ( double_divide @ D @ ( double_divide @ B @ D ) ) ) ) )
= C ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
thf(7,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( double_divide @ ( inverse @ A ) @ ( inverse @ ( double_divide @ ( inverse @ ( double_divide @ A @ ( double_divide @ B @ C ) ) ) @ ( double_divide @ D @ ( double_divide @ B @ D ) ) ) ) )
= C ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [B: $i,A: $i] :
( ( multiply @ A @ B )
= ( inverse @ ( double_divide @ B @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
thf(9,plain,
! [B: $i,A: $i] :
( ( multiply @ A @ B )
= ( inverse @ ( double_divide @ B @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(18,plain,
$false,
inference(e,[status(thm)],[4,7,9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP499-1 : TPTP v8.1.2. Released v2.6.0.
% 0.06/0.14 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n012.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 : Fri May 19 01:33:47 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.96/0.87 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.25/0.98 % [INFO] Parsing done (110ms).
% 1.25/0.98 % [INFO] Running in sequential loop mode.
% 1.65/1.18 % [INFO] eprover registered as external prover.
% 1.65/1.18 % [INFO] cvc4 registered as external prover.
% 1.65/1.19 % [INFO] Scanning for conjecture ...
% 1.65/1.23 % [INFO] Found a conjecture and 2 axioms. Running axiom selection ...
% 1.79/1.25 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 1.79/1.25 % [INFO] Problem is propositional (TPTP CNF).
% 1.79/1.26 % [INFO] Type checking passed.
% 1.88/1.26 % [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.54/1.55 % External prover 'e' found a proof!
% 2.54/1.55 % [INFO] Killing All external provers ...
% 2.54/1.55 % Time passed: 1029ms (effective reasoning time: 567ms)
% 2.54/1.55 % 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.54/1.56 % Axioms used in derivation (2): single_axiom, multiply
% 2.54/1.56 % No. of inferences in proof: 7
% 2.54/1.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1029 ms resp. 567 ms w/o parsing
% 2.62/1.61 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.62/1.62 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------