%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : MSC025^2 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:15:36 AM UTC 2026
% Result : Theorem 9.99s 3.53s
% Output : Refutation 9.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 46
% Number of leaves : 5
% Syntax : Number of formulae : 103 ( 28 unt; 0 typ; 1 def)
% Number of atoms : 373 ( 179 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 458 ( 155 ~; 118 |; 10 &; 154 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 45 ( 0 ^; 42 !; 2 ?; 45 :)
% ( 0 !>; 0 ?*; 0 @-; 1 @+)
% Comments :
%------------------------------------------------------------------------------
thf(one_decl,type,
one: $i ).
thf(two_decl,type,
two: $i ).
thf(b1_decl,type,
b1: $o > $i ).
thf(b2_decl,type,
b2: $o > $i ).
thf(sk1_decl,type,
sk1: $o > $i ).
thf(sk2_decl,type,
sk2: $o ).
thf(sk3_decl,type,
sk3: $o ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $o > $i] :
~ ( ~ ? [B: $o] :
( ( A @ B )
= ( A @ ~ B ) )
=> ( ( A = b1 )
| ( A = b2 ) ) ) ) ) ).
thf(3,axiom,
! [A: $i] :
( ( A = one )
| ( A = two ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binarity_exhaust) ).
thf(16,plain,
! [A: $i] :
( ( A = one )
| ( A = two ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(17,plain,
! [A: $i] :
( ( A = one )
| ( A = two ) ),
inference(cnf,[status(esa)],[16]) ).
thf(18,plain,
! [A: $i] :
( ( A = one )
| ( A = two ) ),
inference(lifteq,[status(thm)],[17]) ).
thf(1,conjecture,
! [A: $o > $i] :
( ! [B: $o] :
( ( A @ B )
!= ( A @ ~ B ) )
=> ( ( A = b1 )
| ( A = b2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
thf(2,negated_conjecture,
~ ! [A: $o > $i] :
( ! [B: $o] :
( ( A @ B )
!= ( A @ ~ B ) )
=> ( ( A = b1 )
| ( A = b2 ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(7,plain,
~ ! [A: $o > $i] :
( ! [B: $o] :
( ( A @ B )
!= ( A @ ~ B ) )
=> ( ( A = b1 )
| ( A = b2 ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(8,plain,
~ ! [A: $o > $i] :
( ~ ? [B: $o] :
( ( A @ B )
= ( A @ ~ B ) )
=> ( ( A = b1 )
| ( A = b2 ) ) ),
inference(miniscope,[status(thm)],[7]) ).
thf(9,plain,
! [A: $o] :
( ( ( sk1 @ A )
!= ( sk1 @ ~ A ) )
& ( sk1 != b1 )
& ( sk1 != b2 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(10,plain,
! [A: $o] :
( ( sk1 @ A )
!= ( sk1 @ ~ A ) ),
inference(cnfConj,[status(thm)],[9]) ).
thf(13,plain,
! [A: $o] :
( ( sk1 @ ~ A )
!= ( sk1 @ A ) ),
inference(lifteq,[status(thm)],[10]) ).
thf(45,plain,
! [B: $o,A: $i] :
( ( A = one )
| ( ( sk1 @ B )
!= two )
| ( A
!= ( sk1 @ ~ B ) ) ),
inference(paramod_ordered,[status(thm)],[18,13]) ).
thf(46,plain,
! [A: $o] :
( ( ( sk1 @ ~ A )
= one )
| ( ( sk1 @ A )
!= two ) ),
inference(pattern_uni,[status(thm)],[45:[bind(A,$thf( sk1 @ ~ ( D ) )),bind(B,$thf( D ))]]) ).
thf(62,plain,
! [A: $o] :
( ( ( sk1 @ ~ A )
= one )
| ( ( sk1 @ A )
!= two ) ),
inference(simp,[status(thm)],[46]) ).
thf(299,plain,
! [B: $o,A: $i] :
( ( A = one )
| ( ( sk1 @ ~ B )
= one )
| ( two != two )
| ( A
!= ( sk1 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[18,62]) ).
thf(300,plain,
! [B: $o,A: $i] :
( ( A = one )
| ( ( sk1 @ ~ B )
= one )
| ( A
!= ( sk1 @ B ) ) ),
inference(simp,[status(thm)],[299]) ).
thf(301,plain,
! [A: $o] :
( ( ( sk1 @ A )
= one )
| ( ( sk1 @ ~ A )
= one ) ),
inference(pattern_uni,[status(thm)],[300:[bind(A,$thf( sk1 @ C )),bind(B,$thf( C ))]]) ).
thf(335,plain,
! [A: $o] :
( ( ( sk1 @ A )
= one )
| ( ( sk1 @ ~ A )
= one ) ),
inference(simp,[status(thm)],[301]) ).
thf(11,plain,
sk1 != b1,
inference(cnfConj,[status(thm)],[9]) ).
thf(14,plain,
sk1 != b1,
inference(lifteq,[status(thm)],[11]) ).
thf(36,plain,
( ( sk1 @ sk2 )
!= ( b1 @ sk2 ) ),
inference(func_ext,[status(esa)],[14]) ).
thf(5,axiom,
! [A: $o] :
( ( A
=> ( ( b1 @ A )
= one ) )
& ( ~ A
=> ( ( b1 @ A )
= two ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b1) ).
thf(22,plain,
! [A: $o] :
( ( A
=> ( ( b1 @ A )
= one ) )
& ( ~ A
=> ( ( b1 @ A )
= two ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(25,plain,
( ( $false
=> ( ( b1 @ $false )
= one ) )
& ( ~ $false
=> ( ( b1 @ $false )
= two ) ) ),
inference(instance,[status(thm)],[22]) ).
thf(26,plain,
( ( b1 @ $false )
= two ),
inference(simp,[status(thm)],[25]) ).
thf(28,plain,
( ( b1 @ $false )
= two ),
inference(lifteq,[status(thm)],[26]) ).
thf(6,axiom,
! [A: $o] :
( ( A
=> ( ( b2 @ A )
= two ) )
& ( ~ A
=> ( ( b2 @ A )
= one ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b2) ).
thf(29,plain,
! [A: $o] :
( ( A
=> ( ( b2 @ A )
= two ) )
& ( ~ A
=> ( ( b2 @ A )
= one ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(32,plain,
( ( $false
=> ( ( b2 @ $false )
= two ) )
& ( ~ $false
=> ( ( b2 @ $false )
= one ) ) ),
inference(instance,[status(thm)],[29]) ).
thf(33,plain,
( ( b2 @ $false )
= one ),
inference(simp,[status(thm)],[32]) ).
thf(35,plain,
( ( b2 @ $false )
= one ),
inference(lifteq,[status(thm)],[33]) ).
thf(12,plain,
sk1 != b2,
inference(cnfConj,[status(thm)],[9]) ).
thf(15,plain,
sk1 != b2,
inference(lifteq,[status(thm)],[12]) ).
thf(37,plain,
( ( sk1 @ sk3 )
!= ( b2 @ sk3 ) ),
inference(func_ext,[status(esa)],[15]) ).
thf(43,plain,
! [A: $i] :
( ( A = one )
| ( ( b2 @ sk3 )
!= two )
| ( A
!= ( sk1 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[18,37]) ).
thf(44,plain,
( ( ( sk1 @ sk3 )
= one )
| ( ( b2 @ sk3 )
!= two ) ),
inference(pattern_uni,[status(thm)],[43:[bind(A,$thf( sk1 @ sk3 ))]]) ).
thf(75,plain,
( ( ( b2 @ sk3 )
!= two )
| ( ( b2 @ sk3 )
!= one )
| ( ( sk1 @ sk3 )
!= ( sk1 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[44,37]) ).
thf(76,plain,
( ( ( b2 @ sk3 )
!= two )
| ( ( b2 @ sk3 )
!= one ) ),
inference(pattern_uni,[status(thm)],[75:[]]) ).
thf(95,plain,
( ( ( b2 @ sk3 )
!= two )
| ( one != one )
| ( ( b2 @ sk3 )
!= ( b2 @ $false ) ) ),
inference(paramod_ordered,[status(thm)],[35,76]) ).
thf(96,plain,
( ( ( b2 @ sk3 )
!= two )
| ( ( b2 @ sk3 )
!= ( b2 @ $false ) ) ),
inference(simp,[status(thm)],[95]) ).
thf(104,plain,
( ( ( b2 @ sk3 )
!= two )
| sk3 ),
inference(simp,[status(thm)],[96]) ).
thf(179,plain,
! [A: $i] :
( ( A = one )
| ( two != two )
| sk3
| ( A
!= ( b2 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[18,104]) ).
thf(180,plain,
! [A: $i] :
( ( A = one )
| sk3
| ( A
!= ( b2 @ sk3 ) ) ),
inference(simp,[status(thm)],[179]) ).
thf(181,plain,
( ( ( b2 @ sk3 )
= one )
| sk3 ),
inference(pattern_uni,[status(thm)],[180:[bind(A,$thf( b2 @ sk3 ))]]) ).
thf(52,plain,
! [A: $i] :
( ( A = one )
| ( ( b1 @ sk2 )
!= two )
| ( A
!= ( sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[18,36]) ).
thf(53,plain,
( ( ( sk1 @ sk2 )
= one )
| ( ( b1 @ sk2 )
!= two ) ),
inference(pattern_uni,[status(thm)],[52:[bind(A,$thf( sk1 @ sk2 ))]]) ).
thf(165,plain,
( ( ( sk1 @ sk2 )
= one )
| ( two != two )
| ( ( b1 @ sk2 )
!= ( b1 @ $false ) ) ),
inference(paramod_ordered,[status(thm)],[28,53]) ).
thf(166,plain,
( ( ( sk1 @ sk2 )
= one )
| ( ( b1 @ sk2 )
!= ( b1 @ $false ) ) ),
inference(simp,[status(thm)],[165]) ).
thf(173,plain,
( ( ( sk1 @ sk2 )
= one )
| sk2 ),
inference(simp,[status(thm)],[166]) ).
thf(185,plain,
( sk2
| ( ( b2 @ sk3 )
!= one )
| ( ( sk1 @ sk3 )
!= ( sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[173,37]) ).
thf(209,plain,
( sk2
| ( ( b2 @ sk3 )
!= one )
| ( sk3 != sk2 ) ),
inference(simp,[status(thm)],[185]) ).
thf(704,plain,
( sk3
| sk2
| ( one != one )
| ( sk3 != sk2 )
| ( ( b2 @ sk3 )
!= ( b2 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[181,209]) ).
thf(705,plain,
( sk3
| sk2
| ( sk3 != sk2 )
| ( ( b2 @ sk3 )
!= ( b2 @ sk3 ) ) ),
inference(simp,[status(thm)],[704]) ).
thf(706,plain,
( sk3
| sk2
| ( sk3 != sk2 ) ),
inference(pattern_uni,[status(thm)],[705:[]]) ).
thf(711,plain,
( sk3
| sk2
| sk3
| sk2 ),
inference(bool_ext,[status(thm)],[706]) ).
thf(712,plain,
( sk3
| sk2 ),
inference(simp,[status(thm)],[711]) ).
thf(30,plain,
( ( $true
=> ( ( b2 @ $true )
= two ) )
& ( ~ $true
=> ( ( b2 @ $true )
= one ) ) ),
inference(instance,[status(thm)],[29]) ).
thf(31,plain,
( ( b2 @ $true )
= two ),
inference(simp,[status(thm)],[30]) ).
thf(34,plain,
( ( b2 @ $true )
= two ),
inference(lifteq,[status(thm)],[31]) ).
thf(78,plain,
( ( ( sk1 @ sk3 )
= one )
| ( two != two )
| ( ( b2 @ sk3 )
!= ( b2 @ $true ) ) ),
inference(paramod_ordered,[status(thm)],[34,44]) ).
thf(79,plain,
( ( ( sk1 @ sk3 )
= one )
| ( ( b2 @ sk3 )
!= ( b2 @ $true ) ) ),
inference(simp,[status(thm)],[78]) ).
thf(90,plain,
( ( ( sk1 @ sk3 )
= one )
| ~ sk3 ),
inference(simp,[status(thm)],[79]) ).
thf(767,plain,
( sk2
| ( ( sk1 @ sk3 )
= one )
| ~ $true
| ( sk3 != sk3 ) ),
inference(paramod_ordered,[status(thm)],[712,90]) ).
thf(768,plain,
( sk2
| ( ( sk1 @ sk3 )
= one )
| ( sk3 != sk3 ) ),
inference(simp,[status(thm)],[767]) ).
thf(769,plain,
( sk2
| ( ( sk1 @ sk3 )
= one ) ),
inference(pattern_uni,[status(thm)],[768:[]]) ).
thf(862,plain,
( sk2
| sk2
| ( ( sk1 @ $true )
= one )
| ( sk3 != sk3 ) ),
inference(paramod_ordered,[status(thm)],[712,769]) ).
thf(863,plain,
( sk2
| ( ( sk1 @ $true )
= one )
| ( sk3 != sk3 ) ),
inference(simp,[status(thm)],[862]) ).
thf(864,plain,
( sk2
| ( ( sk1 @ $true )
= one ) ),
inference(pattern_uni,[status(thm)],[863:[]]) ).
thf(153,plain,
! [A: $o] :
( ( ( b1 @ sk2 )
!= two )
| ( ( sk1 @ A )
!= one )
| ( ( sk1 @ ~ A )
!= ( sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[53,13]) ).
thf(172,plain,
! [A: $o] :
( ( ( b1 @ sk2 )
!= two )
| ( ( sk1 @ A )
!= one )
| ( ( ~ A ) != sk2 ) ),
inference(simp,[status(thm)],[153]) ).
thf(1275,plain,
! [A: $o] :
( sk2
| ( ( b1 @ sk2 )
!= two )
| ( one != one )
| ( ( ~ A ) != sk2 )
| ( ( sk1 @ $true )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[864,172]) ).
thf(1276,plain,
! [A: $o] :
( sk2
| ( ( b1 @ sk2 )
!= two )
| ( ( ~ A ) != sk2 )
| ( ( sk1 @ $true )
!= ( sk1 @ A ) ) ),
inference(simp,[status(thm)],[1275]) ).
thf(1277,plain,
( sk2
| ( ( b1 @ sk2 )
!= two )
| ( ( ~ $true ) != sk2 ) ),
inference(pattern_uni,[status(thm)],[1276:[bind(A,$thf( $true ))]]) ).
thf(1321,plain,
( sk2
| ( ( b1 @ sk2 )
!= two ) ),
inference(simp,[status(thm)],[1277]) ).
thf(1326,plain,
( sk2
| ( two != two )
| ( ( b1 @ sk2 )
!= ( b1 @ $false ) ) ),
inference(paramod_ordered,[status(thm)],[28,1321]) ).
thf(1327,plain,
( sk2
| ( ( b1 @ sk2 )
!= ( b1 @ $false ) ) ),
inference(simp,[status(thm)],[1326]) ).
thf(1332,plain,
( sk2
| sk2 ),
inference(simp,[status(thm)],[1327]) ).
thf(1334,plain,
sk2,
inference(simp,[status(thm)],[1332]) ).
thf(1355,plain,
( ( sk1 @ $true )
!= ( b1 @ $true ) ),
inference(rewrite,[status(thm)],[36,1334]) ).
thf(23,plain,
( ( $true
=> ( ( b1 @ $true )
= one ) )
& ( ~ $true
=> ( ( b1 @ $true )
= two ) ) ),
inference(instance,[status(thm)],[22]) ).
thf(24,plain,
( ( b1 @ $true )
= one ),
inference(simp,[status(thm)],[23]) ).
thf(27,plain,
( ( b1 @ $true )
= one ),
inference(lifteq,[status(thm)],[24]) ).
thf(1379,plain,
( ( sk1 @ $true )
!= one ),
inference(rewrite,[status(thm)],[1355,27]) ).
thf(1380,plain,
! [A: $o] :
( ( ( sk1 @ A )
= one )
| ( one != one )
| ( ( sk1 @ ~ A )
!= ( sk1 @ $true ) ) ),
inference(paramod_ordered,[status(thm)],[335,1379]) ).
thf(1381,plain,
! [A: $o] :
( ( ( sk1 @ A )
= one )
| ( ( sk1 @ ~ A )
!= ( sk1 @ $true ) ) ),
inference(simp,[status(thm)],[1380]) ).
thf(1386,plain,
! [A: $o] :
( ( ( sk1 @ A )
= one )
| ~ ~ A ),
inference(simp,[status(thm)],[1381]) ).
thf(1388,plain,
! [A: $o] :
( ( ( sk1 @ A )
= one )
| A ),
inference(cnf,[status(esa)],[1386]) ).
thf(139,plain,
( ~ sk3
| ( ( b1 @ sk2 )
!= one )
| ( ( sk1 @ sk3 )
!= ( sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[90,36]) ).
thf(146,plain,
( ~ sk3
| ( ( b1 @ sk2 )
!= one )
| ( sk3 != sk2 ) ),
inference(simp,[status(thm)],[139]) ).
thf(239,plain,
( ~ sk3
| ( one != one )
| ( sk3 != sk2 )
| ( ( b1 @ sk2 )
!= ( b1 @ $true ) ) ),
inference(paramod_ordered,[status(thm)],[27,146]) ).
thf(240,plain,
( ~ sk3
| ( sk3 != sk2 )
| ( ( b1 @ sk2 )
!= ( b1 @ $true ) ) ),
inference(simp,[status(thm)],[239]) ).
thf(242,plain,
( ~ sk3
| ( sk3 != sk2 )
| ~ sk2 ),
inference(simp,[status(thm)],[240]) ).
thf(360,plain,
( ~ sk3
| ~ sk2
| ~ sk3
| ~ sk2 ),
inference(bool_ext,[status(thm)],[242]) ).
thf(362,plain,
( ~ sk3
| ~ sk2 ),
inference(simp,[status(thm)],[360]) ).
thf(1350,plain,
( ~ sk3
| ~ $true ),
inference(rewrite,[status(thm)],[362,1334]) ).
thf(1351,plain,
~ sk3,
inference(simp,[status(thm)],[1350]) ).
thf(1357,plain,
( ( sk1 @ $false )
!= ( b2 @ $false ) ),
inference(rewrite,[status(thm)],[37,1351]) ).
thf(1390,plain,
( ( sk1 @ $false )
!= one ),
inference(rewrite,[status(thm)],[1357,35]) ).
thf(1451,plain,
! [A: $o] :
( A
| ( one != one )
| ( ( sk1 @ A )
!= ( sk1 @ $false ) ) ),
inference(paramod_ordered,[status(thm)],[1388,1390]) ).
thf(1452,plain,
! [A: $o] :
( A
| ( ( sk1 @ A )
!= ( sk1 @ $false ) ) ),
inference(simp,[status(thm)],[1451]) ).
thf(1453,plain,
$false,
inference(pattern_uni,[status(thm)],[1452:[bind(A,$thf( $false ))]]) ).
thf(1489,plain,
$false,
inference(simp,[status(thm)],[1453]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC025^2 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.10/0.22 % Computer : n005.cluster.edu
% 0.10/0.22 % Model : x86_64 x86_64
% 0.10/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.22 % Memory : 8046.5625MB
% 0.10/0.22 % OS : Linux 6.8.0-71-generic
% 0.10/0.22 % CPULimit : 300
% 0.10/0.22 % WCLimit : 300
% 0.10/0.22 % DateTime : Tue Sep 29 11:22:16 UTC 2026
% 0.10/0.22 % CPUTime :
% 0.10/0.22 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 1.06/0.81 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.26/0.99 % [INFO] Parsing done (182ms).
% 1.26/1.01 % [INFO] Running in sequential loop mode.
% 2.07/1.41 % [INFO] eprover registered as external prover.
% 2.07/1.42 % [INFO] Scanning for conjecture ...
% 2.25/1.51 % [INFO] Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ...
% 2.25/1.55 % [INFO] Axiom selection finished. Selected 4 axioms (removed 0 axioms).
% 2.25/1.56 % [INFO] Problem is higher-order (TPTP THF).
% 2.25/1.56 % [INFO] Type checking passed.
% 2.25/1.57 % [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.61/1.79 % [INFO] [Domain constraints] Detected constraint on $i
% 2.61/1.79 % [INFO] [Domain constraints] dom($i) ⊆ {one,two}
% 9.99/3.53 % [INFO] Killing All external provers ...
% 9.99/3.53 % Time passed: 3167ms (effective reasoning time: 2519ms)
% 9.99/3.53 % 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)>
% 9.99/3.53 % Axioms used in derivation (3): binarity_exhaust, b1, b2
% 9.99/3.53 % No. of inferences in proof: 102
% 9.99/3.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3167 ms resp. 2519 ms w/o parsing
% 9.99/3.57 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.99/3.57 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------