TSTP Solution File: LCL041-1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : LCL041-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n009.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:13 EDT 2023
% Result : Unsatisfiable 7.07s 2.37s
% Output : Refutation 7.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 82 ( 45 unt; 5 typ; 0 def)
% Number of atoms : 161 ( 74 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 734 ( 99 ~; 48 |; 0 &; 587 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 150 ( 0 ^; 150 !; 0 ?; 150 :)
% Comments :
%------------------------------------------------------------------------------
thf(is_a_theorem_type,type,
is_a_theorem: $i > $o ).
thf(implies_type,type,
implies: $i > $i > $i ).
thf(a_type,type,
a: $i ).
thf(b_type,type,
b: $i ).
thf(not_type,type,
not: $i > $i ).
thf(4,axiom,
! [B: $i,A: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ B @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).
thf(13,plain,
! [B: $i,A: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ B @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(1,negated_conjecture,
~ ( is_a_theorem @ ( implies @ ( implies @ a @ ( implies @ a @ b ) ) @ ( implies @ a @ b ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_30) ).
thf(8,plain,
~ ( is_a_theorem @ ( implies @ ( implies @ a @ ( implies @ a @ b ) ) @ ( implies @ a @ b ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(9,plain,
~ ( is_a_theorem @ ( implies @ ( implies @ a @ ( implies @ a @ b ) ) @ ( implies @ a @ b ) ) ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(17,plain,
! [B: $i,A: $i] :
( ( is_a_theorem @ ( implies @ A @ ( implies @ B @ A ) ) )
!= ( is_a_theorem @ ( implies @ ( implies @ a @ ( implies @ a @ b ) ) @ ( implies @ a @ b ) ) ) ),
inference(paramod_ordered,[status(thm)],[13,9]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( implies @ A @ ( implies @ B @ A ) )
!= ( implies @ ( implies @ a @ ( implies @ a @ b ) ) @ ( implies @ a @ b ) ) ),
inference(simp,[status(thm)],[17]) ).
thf(21,plain,
! [B: $i,A: $i] :
( ( A
!= ( implies @ a @ ( implies @ a @ b ) ) )
| ( ( implies @ B @ A )
!= ( implies @ a @ b ) ) ),
inference(simp,[status(thm)],[18]) ).
thf(22,plain,
! [A: $i] :
( ( implies @ A @ ( implies @ a @ ( implies @ a @ b ) ) )
!= ( implies @ a @ b ) ),
inference(simp,[status(thm)],[21]) ).
thf(23,plain,
! [A: $i] :
( ( A != a )
| ( ( implies @ a @ ( implies @ a @ b ) )
!= b ) ),
inference(simp,[status(thm)],[22]) ).
thf(24,plain,
( ( implies @ a @ ( implies @ a @ b ) )
!= b ),
inference(simp,[status(thm)],[23]) ).
thf(5,axiom,
! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ ( implies @ B @ C ) ) @ ( implies @ B @ ( implies @ A @ C ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_21) ).
thf(14,plain,
! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ ( implies @ B @ C ) ) @ ( implies @ B @ ( implies @ A @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(2,axiom,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ ( implies @ A @ B ) )
| ~ ( is_a_theorem @ A )
| ( is_a_theorem @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
thf(10,plain,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ ( implies @ A @ B ) )
| ~ ( is_a_theorem @ A )
| ( is_a_theorem @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(11,plain,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ ( implies @ A @ B ) )
| ~ ( is_a_theorem @ A )
| ( is_a_theorem @ B ) ),
inference(cnf,[status(esa)],[10]) ).
thf(31,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ C )
| ( is_a_theorem @ D )
| ( ( is_a_theorem @ ( implies @ A @ ( implies @ B @ A ) ) )
!= ( is_a_theorem @ ( implies @ C @ D ) ) ) ),
inference(paramod_ordered,[status(thm)],[13,11]) ).
thf(32,plain,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ B )
| ( is_a_theorem @ ( implies @ A @ B ) ) ),
inference(pattern_uni,[status(thm)],[31:[bind(A,$thf( F )),bind(B,$thf( E )),bind(C,$thf( F )),bind(D,$thf( implies @ E @ F ))]]) ).
thf(46,plain,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ B )
| ( is_a_theorem @ ( implies @ A @ B ) ) ),
inference(simp,[status(thm)],[32]) ).
thf(109,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( is_a_theorem @ ( implies @ C @ D ) )
| ( ( is_a_theorem @ ( implies @ A @ ( implies @ B @ A ) ) )
!= ( is_a_theorem @ D ) ) ),
inference(paramod_ordered,[status(thm)],[13,46]) ).
thf(110,plain,
! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ C @ ( implies @ B @ C ) ) ) ),
inference(pattern_uni,[status(thm)],[109:[bind(A,$thf( H )),bind(B,$thf( G )),bind(C,$thf( C )),bind(D,$thf( implies @ H @ ( implies @ G @ H ) ))]]) ).
thf(129,plain,
! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ C @ ( implies @ B @ C ) ) ) ),
inference(simp,[status(thm)],[110]) ).
thf(107,plain,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ B )
| ( ( is_a_theorem @ ( implies @ A @ B ) )
!= ( is_a_theorem @ ( implies @ ( implies @ a @ ( implies @ a @ b ) ) @ ( implies @ a @ b ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[46,9]) ).
thf(108,plain,
~ ( is_a_theorem @ ( implies @ a @ b ) ),
inference(pattern_uni,[status(thm)],[107:[bind(A,$thf( implies @ a @ ( implies @ a @ b ) )),bind(B,$thf( implies @ a @ b ))]]) ).
thf(134,plain,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ B )
| ( ( is_a_theorem @ ( implies @ A @ B ) )
!= ( is_a_theorem @ ( implies @ a @ b ) ) ) ),
inference(paramod_ordered,[status(thm)],[46,108]) ).
thf(135,plain,
~ ( is_a_theorem @ b ),
inference(pattern_uni,[status(thm)],[134:[bind(A,$thf( a )),bind(B,$thf( b ))]]) ).
thf(198,plain,
! [C: $i,B: $i,A: $i] :
( ( is_a_theorem @ ( implies @ A @ ( implies @ C @ ( implies @ B @ C ) ) ) )
!= ( is_a_theorem @ b ) ),
inference(paramod_ordered,[status(thm)],[129,135]) ).
thf(211,plain,
! [C: $i,B: $i,A: $i] :
( ( implies @ A @ ( implies @ C @ ( implies @ B @ C ) ) )
!= b ),
inference(simp,[status(thm)],[198]) ).
thf(43,plain,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ A )
| ( is_a_theorem @ B )
| ( ( is_a_theorem @ ( implies @ A @ B ) )
!= ( is_a_theorem @ A ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[11]) ).
thf(45,plain,
! [B: $i,A: $i] :
( ( is_a_theorem @ B )
| ~ ( is_a_theorem @ A )
| ( ( implies @ A @ B )
!= A ) ),
inference(simp,[status(thm)],[43]) ).
thf(3,axiom,
! [B: $i,A: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
thf(12,plain,
! [B: $i,A: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(111,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( is_a_theorem @ ( implies @ C @ D ) )
| ( ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) )
!= ( is_a_theorem @ D ) ) ),
inference(paramod_ordered,[status(thm)],[12,46]) ).
thf(112,plain,
! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ C @ ( implies @ ( not @ C ) @ B ) ) ) ),
inference(pattern_uni,[status(thm)],[111:[bind(A,$thf( I )),bind(B,$thf( H )),bind(C,$thf( C )),bind(D,$thf( implies @ I @ ( implies @ ( not @ I ) @ H ) ))]]) ).
thf(123,plain,
! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ C @ ( implies @ ( not @ C ) @ B ) ) ) ),
inference(simp,[status(thm)],[112]) ).
thf(7,axiom,
! [B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ ( not @ A ) @ B ) @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_54) ).
thf(16,plain,
! [B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ ( not @ A ) @ B ) @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(146,plain,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ B )
| ( ( is_a_theorem @ ( implies @ A @ B ) )
!= ( is_a_theorem @ b ) ) ),
inference(paramod_ordered,[status(thm)],[46,135]) ).
thf(153,plain,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ B )
| ( ( implies @ A @ B )
!= b ) ),
inference(simp,[status(thm)],[146]) ).
thf(223,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ B )
| ( ( implies @ C @ D )
!= b )
| ( ( is_a_theorem @ ( implies @ A @ B ) )
!= ( is_a_theorem @ D ) ) ),
inference(paramod_ordered,[status(thm)],[46,153]) ).
thf(224,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ C )
| ( ( implies @ A @ ( implies @ B @ C ) )
!= b ) ),
inference(pattern_uni,[status(thm)],[223:[bind(A,$thf( E )),bind(B,$thf( F )),bind(C,$thf( C )),bind(D,$thf( implies @ E @ F ))]]) ).
thf(231,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ C )
| ( ( implies @ A @ ( implies @ B @ C ) )
!= b ) ),
inference(simp,[status(thm)],[224]) ).
thf(19,plain,
! [B: $i,A: $i] :
( ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) )
!= ( is_a_theorem @ ( implies @ ( implies @ a @ ( implies @ a @ b ) ) @ ( implies @ a @ b ) ) ) ),
inference(paramod_ordered,[status(thm)],[12,9]) ).
thf(20,plain,
! [B: $i,A: $i] :
( ( implies @ A @ ( implies @ ( not @ A ) @ B ) )
!= ( implies @ ( implies @ a @ ( implies @ a @ b ) ) @ ( implies @ a @ b ) ) ),
inference(simp,[status(thm)],[19]) ).
thf(27,plain,
! [B: $i,A: $i] :
( ( A
!= ( implies @ a @ ( implies @ a @ b ) ) )
| ( ( implies @ ( not @ A ) @ B )
!= ( implies @ a @ b ) ) ),
inference(simp,[status(thm)],[20]) ).
thf(28,plain,
! [A: $i] :
( ( implies @ ( not @ ( implies @ a @ ( implies @ a @ b ) ) ) @ A )
!= ( implies @ a @ b ) ),
inference(simp,[status(thm)],[27]) ).
thf(29,plain,
! [A: $i] :
( ( ( not @ ( implies @ a @ ( implies @ a @ b ) ) )
!= a )
| ( A != b ) ),
inference(simp,[status(thm)],[28]) ).
thf(30,plain,
( ( not @ ( implies @ a @ ( implies @ a @ b ) ) )
!= a ),
inference(simp,[status(thm)],[29]) ).
thf(131,plain,
! [B: $i,A: $i] :
( ( is_a_theorem @ ( implies @ A @ ( implies @ B @ A ) ) )
!= ( is_a_theorem @ ( implies @ a @ b ) ) ),
inference(paramod_ordered,[status(thm)],[13,108]) ).
thf(138,plain,
! [B: $i,A: $i] :
( ( implies @ A @ ( implies @ B @ A ) )
!= ( implies @ a @ b ) ),
inference(simp,[status(thm)],[131]) ).
thf(194,plain,
! [B: $i,A: $i] :
( ( A != a )
| ( ( implies @ B @ A )
!= b ) ),
inference(simp,[status(thm)],[138]) ).
thf(195,plain,
! [A: $i] :
( ( implies @ A @ a )
!= b ),
inference(simp,[status(thm)],[194]) ).
thf(25,plain,
! [B: $i,A: $i] :
( ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ ( not @ A ) @ B ) @ B ) ) )
!= ( is_a_theorem @ ( implies @ ( implies @ a @ ( implies @ a @ b ) ) @ ( implies @ a @ b ) ) ) ),
inference(paramod_ordered,[status(thm)],[16,9]) ).
thf(26,plain,
! [B: $i,A: $i] :
( ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ ( not @ A ) @ B ) @ B ) )
!= ( implies @ ( implies @ a @ ( implies @ a @ b ) ) @ ( implies @ a @ b ) ) ),
inference(simp,[status(thm)],[25]) ).
thf(68,plain,
! [B: $i,A: $i] :
( ( ( implies @ A @ B )
!= ( implies @ a @ ( implies @ a @ b ) ) )
| ( ( implies @ ( implies @ ( not @ A ) @ B ) @ B )
!= ( implies @ a @ b ) ) ),
inference(simp,[status(thm)],[26]) ).
thf(71,plain,
! [B: $i,A: $i] :
( ( A != a )
| ( B
!= ( implies @ a @ b ) )
| ( ( implies @ ( not @ A ) @ B )
!= a )
| ( B != b ) ),
inference(simp,[status(thm)],[68]) ).
thf(90,plain,
( ( ( implies @ ( not @ a ) @ ( implies @ a @ b ) )
!= a )
| ( ( implies @ a @ b )
!= b ) ),
inference(simp,[status(thm)],[71]) ).
thf(69,plain,
! [B: $i,A: $i] :
( ( A != a )
| ( B
!= ( implies @ a @ b ) )
| ( ( implies @ ( implies @ ( not @ A ) @ B ) @ B )
!= ( implies @ a @ b ) ) ),
inference(simp,[status(thm)],[68]) ).
thf(88,plain,
( ( implies @ ( implies @ ( not @ a ) @ ( implies @ a @ b ) ) @ ( implies @ a @ b ) )
!= ( implies @ a @ b ) ),
inference(simp,[status(thm)],[69]) ).
thf(73,plain,
! [B: $i,A: $i] :
( ( ( implies @ A @ B )
!= ( implies @ a @ ( implies @ a @ b ) ) )
| ( ( implies @ ( implies @ ( not @ A ) @ B ) @ B )
!= ( implies @ a @ ( implies @ a @ b ) ) )
| ( ( implies @ a @ b )
!= ( implies @ A @ B ) ) ),
inference(eqfactor_ordered,[status(thm)],[68]) ).
thf(76,plain,
! [B: $i,A: $i] :
( ( A != a )
| ( B
!= ( implies @ a @ b ) )
| ( ( implies @ ( not @ A ) @ B )
!= a )
| ( B
!= ( implies @ a @ b ) )
| ( ( implies @ a @ b )
!= ( implies @ A @ B ) ) ),
inference(simp,[status(thm)],[73]) ).
thf(93,plain,
( ( ( implies @ ( not @ a ) @ ( implies @ a @ b ) )
!= a )
| ( ( implies @ a @ ( implies @ a @ b ) )
!= ( implies @ a @ b ) ) ),
inference(simp,[status(thm)],[76]) ).
thf(143,plain,
! [B: $i,A: $i] :
( ( is_a_theorem @ ( implies @ A @ ( implies @ B @ A ) ) )
!= ( is_a_theorem @ b ) ),
inference(paramod_ordered,[status(thm)],[13,135]) ).
thf(152,plain,
! [B: $i,A: $i] :
( ( implies @ A @ ( implies @ B @ A ) )
!= b ),
inference(simp,[status(thm)],[143]) ).
thf(132,plain,
! [B: $i,A: $i] :
( ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) )
!= ( is_a_theorem @ ( implies @ a @ b ) ) ),
inference(paramod_ordered,[status(thm)],[12,108]) ).
thf(139,plain,
! [B: $i,A: $i] :
( ( implies @ A @ ( implies @ ( not @ A ) @ B ) )
!= ( implies @ a @ b ) ),
inference(simp,[status(thm)],[132]) ).
thf(259,plain,
! [B: $i,A: $i] :
( ( A != a )
| ( ( implies @ ( not @ A ) @ B )
!= b ) ),
inference(simp,[status(thm)],[139]) ).
thf(260,plain,
! [A: $i] :
( ( implies @ ( not @ a ) @ A )
!= b ),
inference(simp,[status(thm)],[259]) ).
thf(44,plain,
! [B: $i,A: $i] :
( ( is_a_theorem @ B )
| ~ ( is_a_theorem @ A )
| ( ( is_a_theorem @ ( implies @ A @ B ) )
!= ( is_a_theorem @ A ) ) ),
inference(simp,[status(thm)],[43]) ).
thf(219,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( implies @ C @ D )
!= b )
| ( ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) )
!= ( is_a_theorem @ D ) ) ),
inference(paramod_ordered,[status(thm)],[12,153]) ).
thf(220,plain,
! [C: $i,B: $i,A: $i] :
( ( implies @ A @ ( implies @ C @ ( implies @ ( not @ C ) @ B ) ) )
!= b ),
inference(pattern_uni,[status(thm)],[219:[bind(A,$thf( I )),bind(B,$thf( H )),bind(C,$thf( C )),bind(D,$thf( implies @ I @ ( implies @ ( not @ I ) @ H ) ))]]) ).
thf(236,plain,
! [C: $i,B: $i,A: $i] :
( ( implies @ A @ ( implies @ C @ ( implies @ ( not @ C ) @ B ) ) )
!= b ),
inference(simp,[status(thm)],[220]) ).
thf(144,plain,
! [B: $i,A: $i] :
( ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) )
!= ( is_a_theorem @ b ) ),
inference(paramod_ordered,[status(thm)],[12,135]) ).
thf(150,plain,
! [B: $i,A: $i] :
( ( implies @ A @ ( implies @ ( not @ A ) @ B ) )
!= b ),
inference(simp,[status(thm)],[144]) ).
thf(6,axiom,
! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ C @ A ) @ ( implies @ C @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_22) ).
thf(15,plain,
! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ C @ A ) @ ( implies @ C @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(402,plain,
$false,
inference(e,[status(thm)],[24,14,211,9,45,108,135,123,16,11,231,8,30,195,90,138,88,10,153,20,46,93,152,260,28,13,129,22,44,12,236,18,150,26,139,15,68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL041-1 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n009.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:42:33 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.89/0.83 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.24/0.94 % [INFO] Parsing done (106ms).
% 1.24/0.95 % [INFO] Running in sequential loop mode.
% 1.51/1.14 % [INFO] eprover registered as external prover.
% 1.51/1.15 % [INFO] cvc4 registered as external prover.
% 1.51/1.15 % [INFO] Scanning for conjecture ...
% 1.76/1.20 % [INFO] Found a conjecture and 6 axioms. Running axiom selection ...
% 1.76/1.22 % [INFO] Axiom selection finished. Selected 6 axioms (removed 0 axioms).
% 1.87/1.23 % [INFO] Problem is propositional (TPTP CNF).
% 1.87/1.23 % [INFO] Type checking passed.
% 1.87/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 ...
% 7.07/2.36 % External prover 'e' found a proof!
% 7.07/2.36 % [INFO] Killing All external provers ...
% 7.07/2.36 % Time passed: 1850ms (effective reasoning time: 1413ms)
% 7.07/2.36 % 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)>
% 7.07/2.37 % Axioms used in derivation (6): cn_21, condensed_detachment, cn_54, cn_18, cn_22, cn_3
% 7.07/2.37 % No. of inferences in proof: 77
% 7.07/2.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1850 ms resp. 1413 ms w/o parsing
% 7.10/2.40 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.10/2.40 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------