TSTP Solution File: LCL011-1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : LCL011-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n024.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:29:08 EDT 2023
% Result : Unsatisfiable 2.59s 1.64s
% Output : Refutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 8
% Syntax : Number of formulae : 12 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 11 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 64 ( 6 ~; 4 |; 0 &; 54 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 ^; 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(is_a_theorem_type,type,
is_a_theorem: $i > $o ).
thf(equivalent_type,type,
equivalent: $i > $i > $i ).
thf(a_type,type,
a: $i ).
thf(b_type,type,
b: $i ).
thf(c_type,type,
c: $i ).
thf(1,negated_conjecture,
~ ( is_a_theorem @ ( equivalent @ ( equivalent @ a @ b ) @ ( equivalent @ ( equivalent @ a @ c ) @ ( equivalent @ c @ b ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_yqf) ).
thf(4,plain,
~ ( is_a_theorem @ ( equivalent @ ( equivalent @ a @ b ) @ ( equivalent @ ( equivalent @ a @ c ) @ ( equivalent @ c @ b ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(2,axiom,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equivalent @ A @ B ) )
| ~ ( is_a_theorem @ A )
| ( is_a_theorem @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
thf(6,plain,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equivalent @ A @ B ) )
| ~ ( is_a_theorem @ A )
| ( is_a_theorem @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ A @ B ) @ ( equivalent @ ( equivalent @ C @ A ) @ ( equivalent @ B @ C ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',yqj) ).
thf(8,plain,
! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( equivalent @ ( equivalent @ A @ B ) @ ( equivalent @ ( equivalent @ C @ A ) @ ( equivalent @ B @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(12,plain,
$false,
inference(e,[status(thm)],[4,6,8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : LCL011-1 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.14 % Command : run_Leo-III %s %d
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu May 18 16:08:52 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.83/0.78 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.07/0.91 % [INFO] Parsing done (127ms).
% 1.07/0.92 % [INFO] Running in sequential loop mode.
% 1.54/1.20 % [INFO] eprover registered as external prover.
% 1.54/1.21 % [INFO] cvc4 registered as external prover.
% 1.63/1.21 % [INFO] Scanning for conjecture ...
% 1.67/1.27 % [INFO] Found a conjecture and 2 axioms. Running axiom selection ...
% 1.67/1.29 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 1.67/1.29 % [INFO] Problem is propositional (TPTP CNF).
% 1.67/1.29 % [INFO] Type checking passed.
% 1.67/1.30 % [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.59/1.63 % External prover 'e' found a proof!
% 2.59/1.63 % [INFO] Killing All external provers ...
% 2.59/1.63 % Time passed: 1157ms (effective reasoning time: 705ms)
% 2.59/1.63 % 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.59/1.63 % Axioms used in derivation (2): condensed_detachment, yqj
% 2.59/1.63 % No. of inferences in proof: 7
% 2.59/1.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1157 ms resp. 705 ms w/o parsing
% 2.75/1.70 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.75/1.70 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------