TSTP Solution File: ANA042-2 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : ANA042-2 : TPTP v8.1.2. Released v3.2.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 10:08:59 EDT 2023
% Result : Unsatisfiable 2.63s 1.55s
% Output : Refutation 2.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 16 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 9 ( 1 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 104 ( 4 ~; 0 |; 0 &; 100 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 10 ( 0 ^; 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(c_lessequals_type,type,
c_lessequals: $i > $i > $i > $o ).
thf(c_HOL_Oabs_type,type,
c_HOL_Oabs: $i > $i > $i ).
thf(v_f_type,type,
v_f: $i > $i > $i ).
thf(t_c_type,type,
t_c: $i ).
thf(c_times_type,type,
c_times: $i > $i > $i > $i ).
thf(v_x_type,type,
v_x: $i ).
thf(v_h_type,type,
v_h: $i > $i > $i ).
thf(v_xa_type,type,
v_xa: $i > $i ).
thf(v_xb_type,type,
v_xb: $i > $i ).
thf(1,negated_conjecture,
! [B: $i,A: $i] : ( c_lessequals @ ( c_HOL_Oabs @ ( v_f @ A @ B ) @ t_c ) @ ( c_times @ v_x @ ( v_h @ A @ B ) @ t_c ) @ t_c ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
thf(3,plain,
! [B: $i,A: $i] : ( c_lessequals @ ( c_HOL_Oabs @ ( v_f @ A @ B ) @ t_c ) @ ( c_times @ v_x @ ( v_h @ A @ B ) @ t_c ) @ t_c ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(2,negated_conjecture,
! [A: $i] :
~ ( c_lessequals @ ( c_HOL_Oabs @ ( v_f @ ( v_xa @ A ) @ ( v_xb @ A ) ) @ t_c ) @ ( c_times @ A @ ( v_h @ ( v_xa @ A ) @ ( v_xb @ A ) ) @ t_c ) @ t_c ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
thf(4,plain,
! [A: $i] :
~ ( c_lessequals @ ( c_HOL_Oabs @ ( v_f @ ( v_xa @ A ) @ ( v_xb @ A ) ) @ t_c ) @ ( c_times @ A @ ( v_h @ ( v_xa @ A ) @ ( v_xb @ A ) ) @ t_c ) @ t_c ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
! [A: $i] :
~ ( c_lessequals @ ( c_HOL_Oabs @ ( v_f @ ( v_xa @ A ) @ ( v_xb @ A ) ) @ t_c ) @ ( c_times @ A @ ( v_h @ ( v_xa @ A ) @ ( v_xb @ A ) ) @ t_c ) @ t_c ),
inference(polarity_switch,[status(thm)],[4]) ).
thf(6,plain,
! [C: $i,B: $i,A: $i] :
( ( c_lessequals @ ( c_HOL_Oabs @ ( v_f @ A @ B ) @ t_c ) @ ( c_times @ v_x @ ( v_h @ A @ B ) @ t_c ) @ t_c )
!= ( c_lessequals @ ( c_HOL_Oabs @ ( v_f @ ( v_xa @ C ) @ ( v_xb @ C ) ) @ t_c ) @ ( c_times @ C @ ( v_h @ ( v_xa @ C ) @ ( v_xb @ C ) ) @ t_c ) @ t_c ) ),
inference(paramod_ordered,[status(thm)],[3,5]) ).
thf(7,plain,
$false,
inference(pattern_uni,[status(thm)],[6:[bind(A,$thf( v_xa @ v_x )),bind(B,$thf( v_xb @ v_x )),bind(C,$thf( v_x ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ANA042-2 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.14 % Command : run_Leo-III %s %d
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 18 17:55:28 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.90/0.84 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.20/0.94 % [INFO] Parsing done (101ms).
% 1.20/0.95 % [INFO] Running in sequential loop mode.
% 1.58/1.14 % [INFO] eprover registered as external prover.
% 1.58/1.14 % [INFO] cvc4 registered as external prover.
% 1.58/1.15 % [INFO] Scanning for conjecture ...
% 1.69/1.20 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.69/1.22 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.69/1.23 % [INFO] Problem is propositional (TPTP CNF).
% 1.69/1.23 % [INFO] Type checking passed.
% 1.69/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.63/1.55 % [INFO] Killing All external provers ...
% 2.63/1.55 % Time passed: 1036ms (effective reasoning time: 599ms)
% 2.63/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.63/1.55 % Axioms used in derivation (0):
% 2.63/1.55 % No. of inferences in proof: 7
% 2.63/1.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1036 ms resp. 599 ms w/o parsing
% 2.72/1.62 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.72/1.62 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------