TSTP Solution File: GRP555-1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : GRP555-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n006.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:19 EDT 2023
% Result : Unsatisfiable 2.84s 1.64s
% Output : Refutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 9
% Syntax : Number of formulae : 13 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 7 ( 6 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 46 ( 2 ~; 0 |; 0 &; 44 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 ^; 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(multiply_type,type,
multiply: $i > $i > $i ).
thf(a3_type,type,
a3: $i ).
thf(b3_type,type,
b3: $i ).
thf(c3_type,type,
c3: $i ).
thf(divide_type,type,
divide: $i > $i > $i ).
thf(inverse_type,type,
inverse: $i > $i ).
thf(1,negated_conjecture,
( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
thf(4,plain,
( ( multiply @ ( multiply @ a3 @ b3 ) @ c3 )
!= ( multiply @ a3 @ ( multiply @ b3 @ c3 ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(2,axiom,
! [C: $i,B: $i,A: $i] :
( ( divide @ ( divide @ A @ ( inverse @ ( divide @ B @ ( divide @ A @ C ) ) ) ) @ C )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
thf(7,plain,
! [C: $i,B: $i,A: $i] :
( ( divide @ ( divide @ A @ ( inverse @ ( divide @ B @ ( divide @ A @ C ) ) ) ) @ C )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [B: $i,A: $i] :
( ( multiply @ A @ B )
= ( divide @ A @ ( inverse @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
thf(9,plain,
! [B: $i,A: $i] :
( ( multiply @ A @ B )
= ( divide @ A @ ( inverse @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(31,plain,
$false,
inference(e,[status(thm)],[4,7,9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP555-1 : TPTP v8.1.2. Released v2.6.0.
% 0.11/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n006.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 : Fri May 19 02:00:37 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.87/0.85 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.14/0.96 % [INFO] Parsing done (103ms).
% 1.14/0.97 % [INFO] Running in sequential loop mode.
% 1.50/1.15 % [INFO] eprover registered as external prover.
% 1.50/1.15 % [INFO] cvc4 registered as external prover.
% 1.50/1.16 % [INFO] Scanning for conjecture ...
% 1.73/1.20 % [INFO] Found a conjecture and 2 axioms. Running axiom selection ...
% 1.81/1.22 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 1.81/1.22 % [INFO] Problem is propositional (TPTP CNF).
% 1.81/1.23 % [INFO] Type checking passed.
% 1.85/1.23 % [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.84/1.64 % External prover 'e' found a proof!
% 2.84/1.64 % [INFO] Killing All external provers ...
% 2.84/1.64 % Time passed: 1107ms (effective reasoning time: 668ms)
% 2.84/1.64 % 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.84/1.64 % Axioms used in derivation (2): single_axiom, multiply
% 2.84/1.64 % No. of inferences in proof: 7
% 2.84/1.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1107 ms resp. 668 ms w/o parsing
% 2.84/1.65 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.84/1.65 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------