TSTP Solution File: GRP516-1 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : GRP516-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n001.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 : Mon Jun 24 07:09:51 EDT 2024
% Result : Unsatisfiable 236.97s 58.49s
% Output : Refutation 236.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 6
% Syntax : Number of formulae : 59 ( 35 unt; 4 typ; 0 def)
% Number of atoms : 76 ( 75 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 663 ( 43 ~; 21 |; 0 &; 599 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 165 ( 0 ^ 165 !; 0 ?; 165 :)
% Comments :
%------------------------------------------------------------------------------
thf(multiply_type,type,
multiply: $i > $i > $i ).
thf(a_type,type,
a: $i ).
thf(b_type,type,
b: $i ).
thf(inverse_type,type,
inverse: $i > $i ).
thf(2,axiom,
! [C: $i,B: $i,A: $i] :
( ( multiply @ A @ ( multiply @ ( multiply @ B @ C ) @ ( inverse @ ( multiply @ A @ C ) ) ) )
= B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
thf(6,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ A @ ( multiply @ ( multiply @ B @ C ) @ ( inverse @ ( multiply @ A @ C ) ) ) )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ A @ ( multiply @ ( multiply @ B @ C ) @ ( inverse @ ( multiply @ A @ C ) ) ) )
= B ),
inference(lifteq,[status(thm)],[6]) ).
thf(12,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( multiply @ D @ ( multiply @ ( multiply @ E @ F ) @ ( inverse @ B ) ) )
= E )
| ( ( multiply @ A @ ( multiply @ ( multiply @ B @ C ) @ ( inverse @ ( multiply @ A @ C ) ) ) )
!= ( multiply @ D @ F ) ) ),
inference(paramod_ordered,[status(thm)],[7,7]) ).
thf(13,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( multiply @ C @ ( multiply @ ( multiply @ A @ ( multiply @ ( multiply @ B @ D ) @ ( inverse @ ( multiply @ C @ D ) ) ) ) @ ( inverse @ B ) ) )
= A ),
inference(pattern_uni,[status(thm)],[12:[bind(A,$thf( L )),bind(B,$thf( I )),bind(C,$thf( M )),bind(D,$thf( L )),bind(E,$thf( E )),bind(F,$thf( multiply @ ( multiply @ I @ M ) @ ( inverse @ ( multiply @ L @ M ) ) ))]]) ).
thf(22,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( multiply @ C @ ( multiply @ ( multiply @ A @ ( multiply @ ( multiply @ B @ D ) @ ( inverse @ ( multiply @ C @ D ) ) ) ) @ ( inverse @ B ) ) )
= A ),
inference(simp,[status(thm)],[13]) ).
thf(90,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( multiply @ F @ ( multiply @ B @ ( inverse @ E ) ) )
= D )
| ( ( multiply @ A @ ( multiply @ ( multiply @ B @ C ) @ ( inverse @ ( multiply @ A @ C ) ) ) )
!= ( multiply @ D @ ( multiply @ ( multiply @ E @ G ) @ ( inverse @ ( multiply @ F @ G ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[7,22]) ).
thf(91,plain,
! [B: $i,A: $i] :
( ( multiply @ A @ ( multiply @ B @ ( inverse @ B ) ) )
= A ),
inference(pattern_uni,[status(thm)],[90:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( A )),bind(E,$thf( B )),bind(F,$thf( A )),bind(G,$thf( C ))]]) ).
thf(511,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( multiply @ E @ ( multiply @ A @ ( inverse @ D ) ) )
= C )
| ( ( multiply @ A @ ( multiply @ B @ ( inverse @ B ) ) )
!= ( multiply @ C @ ( multiply @ ( multiply @ D @ F ) @ ( inverse @ ( multiply @ E @ F ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[91,22]) ).
thf(512,plain,
! [B: $i,A: $i] :
( ( multiply @ B @ ( multiply @ A @ ( inverse @ B ) ) )
= A ),
inference(pattern_uni,[status(thm)],[511:[bind(A,$thf( A )),bind(B,$thf( multiply @ G @ H )),bind(C,$thf( A )),bind(D,$thf( G )),bind(E,$thf( G )),bind(F,$thf( H ))]]) ).
thf(590,plain,
! [B: $i,A: $i] :
( ( multiply @ B @ ( multiply @ A @ ( inverse @ B ) ) )
= A ),
inference(simp,[status(thm)],[512]) ).
thf(14,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( multiply @ D @ ( multiply @ B @ ( inverse @ ( multiply @ D @ F ) ) ) )
= E )
| ( ( multiply @ A @ ( multiply @ ( multiply @ B @ C ) @ ( inverse @ ( multiply @ A @ C ) ) ) )
!= ( multiply @ E @ F ) ) ),
inference(paramod_ordered,[status(thm)],[7,7]) ).
thf(15,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( multiply @ A @ ( multiply @ B @ ( inverse @ ( multiply @ A @ ( multiply @ ( multiply @ B @ D ) @ ( inverse @ ( multiply @ C @ D ) ) ) ) ) ) )
= C ),
inference(pattern_uni,[status(thm)],[14:[bind(A,$thf( L )),bind(B,$thf( I )),bind(C,$thf( M )),bind(D,$thf( D )),bind(E,$thf( L )),bind(F,$thf( multiply @ ( multiply @ I @ M ) @ ( inverse @ ( multiply @ L @ M ) ) ))]]) ).
thf(23,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( multiply @ A @ ( multiply @ B @ ( inverse @ ( multiply @ A @ ( multiply @ ( multiply @ B @ D ) @ ( inverse @ ( multiply @ C @ D ) ) ) ) ) ) )
= C ),
inference(simp,[status(thm)],[15]) ).
thf(1046,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( multiply @ C @ ( multiply @ D @ ( inverse @ A ) ) )
= E )
| ( ( multiply @ B @ ( multiply @ A @ ( inverse @ B ) ) )
!= ( multiply @ C @ ( multiply @ ( multiply @ D @ F ) @ ( inverse @ ( multiply @ E @ F ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[590,23]) ).
thf(1047,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( multiply @ B @ C ) @ ( multiply @ A @ ( inverse @ ( multiply @ A @ C ) ) ) )
= B ),
inference(pattern_uni,[status(thm)],[1046:[bind(A,$thf( multiply @ G @ J )),bind(B,$thf( multiply @ I @ J )),bind(C,$thf( multiply @ I @ J )),bind(D,$thf( G )),bind(E,$thf( I )),bind(F,$thf( J ))]]) ).
thf(1229,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( multiply @ B @ C ) @ ( multiply @ A @ ( inverse @ ( multiply @ A @ C ) ) ) )
= B ),
inference(simp,[status(thm)],[1047]) ).
thf(4102,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( multiply @ D @ ( multiply @ E @ ( inverse @ B ) ) )
= F )
| ( ( multiply @ ( multiply @ B @ C ) @ ( multiply @ A @ ( inverse @ ( multiply @ A @ C ) ) ) )
!= ( multiply @ D @ ( multiply @ ( multiply @ E @ G ) @ ( inverse @ ( multiply @ F @ G ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[1229,23]) ).
thf(4103,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( multiply @ A @ B ) @ ( multiply @ C @ ( inverse @ A ) ) )
= ( multiply @ C @ B ) ),
inference(pattern_uni,[status(thm)],[4102:[bind(A,$thf( multiply @ L @ I )),bind(B,$thf( H )),bind(C,$thf( I )),bind(D,$thf( multiply @ H @ I )),bind(E,$thf( L )),bind(F,$thf( multiply @ L @ I )),bind(G,$thf( I ))]]) ).
thf(4459,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( multiply @ A @ B ) @ ( multiply @ C @ ( inverse @ A ) ) )
= ( multiply @ C @ B ) ),
inference(simp,[status(thm)],[4103]) ).
thf(787,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( multiply @ E @ ( multiply @ A @ ( inverse @ D ) ) )
= C )
| ( ( multiply @ B @ ( multiply @ A @ ( inverse @ B ) ) )
!= ( multiply @ C @ ( multiply @ ( multiply @ D @ F ) @ ( inverse @ ( multiply @ E @ F ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[590,22]) ).
thf(788,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ B @ ( multiply @ ( multiply @ A @ C ) @ ( inverse @ A ) ) )
= ( multiply @ B @ C ) ),
inference(pattern_uni,[status(thm)],[787:[bind(A,$thf( multiply @ G @ J )),bind(B,$thf( multiply @ I @ J )),bind(C,$thf( multiply @ I @ J )),bind(D,$thf( G )),bind(E,$thf( I )),bind(F,$thf( J ))]]) ).
thf(893,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ B @ ( multiply @ ( multiply @ A @ C ) @ ( inverse @ A ) ) )
= ( multiply @ B @ C ) ),
inference(simp,[status(thm)],[788]) ).
thf(7598,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( multiply @ C @ B )
= ( multiply @ E @ F ) )
| ( ( multiply @ ( multiply @ A @ B ) @ ( multiply @ C @ ( inverse @ A ) ) )
!= ( multiply @ E @ ( multiply @ ( multiply @ D @ F ) @ ( inverse @ D ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[4459,893]) ).
thf(7599,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( multiply @ A @ C ) @ B )
= ( multiply @ ( multiply @ A @ B ) @ C ) ),
inference(pattern_uni,[status(thm)],[7598:[bind(A,$thf( G )),bind(B,$thf( H )),bind(C,$thf( multiply @ G @ J )),bind(D,$thf( G )),bind(E,$thf( multiply @ G @ H )),bind(F,$thf( J ))]]) ).
thf(8596,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( multiply @ A @ C ) @ B )
= ( multiply @ ( multiply @ A @ B ) @ C ) ),
inference(simp,[status(thm)],[7599]) ).
thf(10462,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B
= ( multiply @ ( multiply @ D @ E ) @ F ) )
| ( ( multiply @ ( multiply @ B @ C ) @ ( multiply @ A @ ( inverse @ ( multiply @ A @ C ) ) ) )
!= ( multiply @ ( multiply @ D @ F ) @ E ) ) ),
inference(paramod_ordered,[status(thm)],[1229,8596]) ).
thf(10463,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( multiply @ A @ ( multiply @ B @ ( inverse @ ( multiply @ B @ C ) ) ) ) @ C )
= A ),
inference(pattern_uni,[status(thm)],[10462:[bind(A,$thf( J )),bind(B,$thf( B )),bind(C,$thf( K )),bind(D,$thf( B )),bind(E,$thf( multiply @ J @ ( inverse @ ( multiply @ J @ K ) ) )),bind(F,$thf( K ))]]) ).
thf(10857,plain,
! [C: $i,B: $i,A: $i] :
( ( multiply @ ( multiply @ A @ ( multiply @ B @ ( inverse @ ( multiply @ B @ C ) ) ) ) @ C )
= A ),
inference(simp,[status(thm)],[10463]) ).
thf(31250,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( multiply @ F @ A )
= D )
| ( ( multiply @ ( multiply @ A @ ( multiply @ B @ ( inverse @ ( multiply @ B @ C ) ) ) ) @ C )
!= ( multiply @ ( multiply @ D @ ( multiply @ ( multiply @ E @ G ) @ ( inverse @ ( multiply @ F @ G ) ) ) ) @ ( inverse @ E ) ) ) ),
inference(paramod_ordered,[status(thm)],[10857,22]) ).
thf(31251,plain,
! [B: $i,A: $i] :
( ( multiply @ ( multiply @ B @ ( inverse @ B ) ) @ A )
= A ),
inference(pattern_uni,[status(thm)],[31250:[bind(A,$thf( A )),bind(B,$thf( multiply @ L @ ( inverse @ L ) )),bind(C,$thf( inverse @ L )),bind(D,$thf( A )),bind(E,$thf( L )),bind(F,$thf( multiply @ L @ ( inverse @ L ) )),bind(G,$thf( inverse @ L ))]]) ).
thf(32534,plain,
! [B: $i,A: $i] :
( ( multiply @ ( multiply @ B @ ( inverse @ B ) ) @ A )
= A ),
inference(simp,[status(thm)],[31251]) ).
thf(1,negated_conjecture,
( ( multiply @ a @ b )
!= ( multiply @ b @ a ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).
thf(3,plain,
( ( multiply @ a @ b )
!= ( multiply @ b @ a ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(4,plain,
( ( multiply @ a @ b )
!= ( multiply @ b @ a ) ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(5,plain,
( ( multiply @ b @ a )
!= ( multiply @ a @ b ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(10,plain,
! [C: $i,B: $i,A: $i] :
( ( B
!= ( multiply @ a @ b ) )
| ( ( multiply @ A @ ( multiply @ ( multiply @ B @ C ) @ ( inverse @ ( multiply @ A @ C ) ) ) )
!= ( multiply @ b @ a ) ) ),
inference(paramod_ordered,[status(thm)],[7,5]) ).
thf(17,plain,
! [B: $i,A: $i] :
( ( A != b )
| ( ( multiply @ ( multiply @ ( multiply @ a @ b ) @ B ) @ ( inverse @ ( multiply @ A @ B ) ) )
!= a ) ),
inference(simp,[status(thm)],[10]) ).
thf(20,plain,
! [A: $i] :
( ( multiply @ ( multiply @ ( multiply @ a @ b ) @ A ) @ ( inverse @ ( multiply @ b @ A ) ) )
!= a ),
inference(simp,[status(thm)],[17]) ).
thf(24,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( multiply @ ( multiply @ ( multiply @ a @ b ) @ D ) @ ( inverse @ B ) )
!= a )
| ( ( multiply @ A @ ( multiply @ ( multiply @ B @ C ) @ ( inverse @ ( multiply @ A @ C ) ) ) )
!= ( multiply @ b @ D ) ) ),
inference(paramod_ordered,[status(thm)],[7,20]) ).
thf(25,plain,
! [B: $i,A: $i] :
( ( multiply @ ( multiply @ ( multiply @ a @ b ) @ ( multiply @ ( multiply @ A @ B ) @ ( inverse @ ( multiply @ b @ B ) ) ) ) @ ( inverse @ A ) )
!= a ),
inference(pattern_uni,[status(thm)],[24:[bind(A,$thf( b )),bind(B,$thf( G )),bind(C,$thf( K )),bind(D,$thf( multiply @ ( multiply @ G @ K ) @ ( inverse @ ( multiply @ b @ K ) ) ))]]) ).
thf(34,plain,
! [B: $i,A: $i] :
( ( multiply @ ( multiply @ ( multiply @ a @ b ) @ ( multiply @ ( multiply @ A @ B ) @ ( inverse @ ( multiply @ b @ B ) ) ) ) @ ( inverse @ A ) )
!= a ),
inference(simp,[status(thm)],[25]) ).
thf(498,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( multiply @ A @ ( inverse @ C ) )
!= a )
| ( ( multiply @ A @ ( multiply @ B @ ( inverse @ B ) ) )
!= ( multiply @ ( multiply @ a @ b ) @ ( multiply @ ( multiply @ C @ D ) @ ( inverse @ ( multiply @ b @ D ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[91,34]) ).
thf(499,plain,
( ( multiply @ ( multiply @ a @ b ) @ ( inverse @ b ) )
!= a ),
inference(pattern_uni,[status(thm)],[498:[bind(A,$thf( multiply @ a @ b )),bind(B,$thf( multiply @ b @ H )),bind(C,$thf( b )),bind(D,$thf( H ))]]) ).
thf(642,plain,
! [C: $i,B: $i,A: $i] :
( ( B != a )
| ( ( multiply @ A @ ( multiply @ ( multiply @ B @ C ) @ ( inverse @ ( multiply @ A @ C ) ) ) )
!= ( multiply @ ( multiply @ a @ b ) @ ( inverse @ b ) ) ) ),
inference(paramod_ordered,[status(thm)],[7,499]) ).
thf(656,plain,
! [B: $i,A: $i] :
( ( A
!= ( multiply @ a @ b ) )
| ( ( multiply @ ( multiply @ a @ B ) @ ( inverse @ ( multiply @ A @ B ) ) )
!= ( inverse @ b ) ) ),
inference(simp,[status(thm)],[642]) ).
thf(664,plain,
! [A: $i] :
( ( multiply @ ( multiply @ a @ A ) @ ( inverse @ ( multiply @ ( multiply @ a @ b ) @ A ) ) )
!= ( inverse @ b ) ),
inference(simp,[status(thm)],[656]) ).
thf(35231,plain,
! [C: $i,B: $i,A: $i] :
( ( A
!= ( inverse @ b ) )
| ( ( multiply @ ( multiply @ B @ ( inverse @ B ) ) @ A )
!= ( multiply @ ( multiply @ a @ C ) @ ( inverse @ ( multiply @ ( multiply @ a @ b ) @ C ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[32534,664]) ).
thf(35232,plain,
( ( inverse @ ( multiply @ ( multiply @ a @ b ) @ ( inverse @ a ) ) )
!= ( inverse @ b ) ),
inference(pattern_uni,[status(thm)],[35231:[bind(A,$thf( inverse @ ( multiply @ ( multiply @ a @ b ) @ ( inverse @ a ) ) )),bind(B,$thf( a )),bind(C,$thf( inverse @ a ))]]) ).
thf(40797,plain,
! [B: $i,A: $i] :
( ( ( inverse @ ( multiply @ A @ ( inverse @ a ) ) )
!= ( inverse @ b ) )
| ( ( multiply @ B @ ( multiply @ A @ ( inverse @ B ) ) )
!= ( multiply @ a @ b ) ) ),
inference(paramod_ordered,[status(thm)],[590,35232]) ).
thf(40836,plain,
! [B: $i,A: $i] :
( ( ( multiply @ A @ ( inverse @ a ) )
!= b )
| ( B != a )
| ( ( multiply @ A @ ( inverse @ B ) )
!= b ) ),
inference(simp,[status(thm)],[40797]) ).
thf(40950,plain,
! [A: $i] :
( ( multiply @ A @ ( inverse @ a ) )
!= b ),
inference(simp,[status(thm)],[40836]) ).
thf(41205,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A != b )
| ( ( multiply @ ( multiply @ A @ ( multiply @ B @ ( inverse @ ( multiply @ B @ C ) ) ) ) @ C )
!= ( multiply @ D @ ( inverse @ a ) ) ) ),
inference(paramod_ordered,[status(thm)],[10857,40950]) ).
thf(41206,plain,
! [A: $i] : ( A != b ),
inference(pattern_uni,[status(thm)],[41205:[bind(A,$thf( E )),bind(B,$thf( J )),bind(C,$thf( inverse @ a )),bind(D,$thf( multiply @ E @ ( multiply @ J @ ( inverse @ ( multiply @ J @ ( inverse @ a ) ) ) ) ))]]) ).
thf(41283,plain,
$false,
inference(simp,[status(thm)],[41206]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP516-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% 0.03/0.12 % Command : run_Leo-III %s %d SAT
% 0.12/0.33 % Computer : n001.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 08:32:25 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.95/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.12/0.96 % [INFO] Parsing done (94ms).
% 1.12/0.97 % [INFO] Running in sequential loop mode.
% 1.60/1.17 % [INFO] nitpick registered as external prover.
% 1.60/1.18 % [INFO] Scanning for conjecture ...
% 1.60/1.22 % [INFO] Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ...
% 1.75/1.24 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 1.75/1.24 % [INFO] Problem is propositional (TPTP CNF).
% 1.75/1.25 % [INFO] Type checking passed.
% 1.75/1.25 % [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 ...
% 236.97/58.49 % [INFO] Killing All external provers ...
% 236.97/58.49 % Time passed: 57955ms (effective reasoning time: 57516ms)
% 236.97/58.49 % Axioms used in derivation (1): single_axiom
% 236.97/58.49 % No. of inferences in proof: 55
% 236.97/58.49 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 57955 ms resp. 57516 ms w/o parsing
% 236.97/58.53 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 236.97/58.53 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------