TSTP Solution File: SYO178^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO178^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n020.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 : Tue May 21 08:59:29 EDT 2024
% Result : Theorem 7.56s 2.97s
% Output : Refutation 7.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 46
% Number of leaves : 12
% Syntax : Number of formulae : 153 ( 9 unt; 11 typ; 0 def)
% Number of atoms : 725 ( 40 equ; 0 cnn)
% Maximal formula atoms : 58 ( 5 avg)
% Number of connectives : 839 ( 336 ~; 435 |; 68 &; 0 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 13 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(cM_type,type,
cM: $o ).
thf(cN_type,type,
cN: $o ).
thf(cG_type,type,
cG: $o ).
thf(cK_type,type,
cK: $o ).
thf(cE_type,type,
cE: $o ).
thf(cR_type,type,
cR: $o ).
thf(cF_type,type,
cF: $o ).
thf(cC_type,type,
cC: $o ).
thf(cB_type,type,
cB: $o ).
thf(cP_type,type,
cP: $o ).
thf(cL_type,type,
cL: $o ).
thf(1,conjecture,
~ ( cL
& cE
& ( ~ cF
| cB )
& ( ~ cL
| ~ cP
| cM )
& ( ~ cG
| cR
| cM )
& ( cG
| cP
| cR )
& ( ~ cK
| ~ cB
| cC )
& ( ~ cL
| ~ cM
| cC )
& ( cG
| cR
| cK )
& ( ~ cR
| ~ cE
| ~ cC )
& ( ~ cR
| cN
| cF
| cP )
& ( ~ cK
| ~ cL
| ~ cE
| ~ cM )
& ( ~ cG
| cK
| cM
| ~ cB )
& ( ~ cN
| cP
| cF
| cC )
& ( ~ cG
| ~ cB
| cR
| ~ cC )
& ( cK
| ~ cN
| ~ cM
| cF )
& ( ~ cR
| cK
| cM
| cG )
& ( ~ cE
| cK
| ~ cG
| cN
| ~ cM ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cPORKCHOP1C) ).
thf(2,negated_conjecture,
~ ~ ( cL
& cE
& ( ~ cF
| cB )
& ( ~ cL
| ~ cP
| cM )
& ( ~ cG
| cR
| cM )
& ( cG
| cP
| cR )
& ( ~ cK
| ~ cB
| cC )
& ( ~ cL
| ~ cM
| cC )
& ( cG
| cR
| cK )
& ( ~ cR
| ~ cE
| ~ cC )
& ( ~ cR
| cN
| cF
| cP )
& ( ~ cK
| ~ cL
| ~ cE
| ~ cM )
& ( ~ cG
| cK
| cM
| ~ cB )
& ( ~ cN
| cP
| cF
| cC )
& ( ~ cG
| ~ cB
| cR
| ~ cC )
& ( cK
| ~ cN
| ~ cM
| cF )
& ( ~ cR
| cK
| cM
| cG )
& ( ~ cE
| cK
| ~ cG
| cN
| ~ cM ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ~ ( cL
& cE
& ( ~ cF
| cB )
& ( ~ cL
| ~ cP
| cM )
& ( ~ cG
| cR
| cM )
& ( cG
| cP
| cR )
& ( ~ cK
| ~ cB
| cC )
& ( ~ cL
| ~ cM
| cC )
& ( cG
| cR
| cK )
& ( ~ cR
| ~ cE
| ~ cC )
& ( ~ cR
| cN
| cF
| cP )
& ( ~ cK
| ~ cL
| ~ cE
| ~ cM )
& ( ~ cG
| cK
| cM
| ~ cB )
& ( ~ cN
| cP
| cF
| cC )
& ( ~ cG
| ~ cB
| cR
| ~ cC )
& ( cK
| ~ cN
| ~ cM
| cF )
& ( ~ cR
| cK
| cM
| cG )
& ( ~ cE
| cK
| ~ cG
| cN
| ~ cM ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( cL
& cE
& ( ~ cF
| cB )
& ( ~ cL
| ~ cP
| cM )
& ( ~ cG
| cR
| cM )
& ( cG
| cP
| cR )
& ( ~ cK
| ~ cB
| cC )
& ( ~ cL
| ~ cM
| cC )
& ( cG
| cR
| cK )
& ( ~ cR
| ~ cE
| ~ cC )
& ( ~ cR
| cN
| cF
| cP )
& ( ~ cK
| ~ cL
| ~ cE
| ~ cM )
& ( ~ cG
| cK
| cM
| ~ cB )
& ( ~ cN
| cP
| cF
| cC )
& ( ~ cG
| ~ cB
| cR
| ~ cC )
& ( cK
| ~ cN
| ~ cM
| cF )
& ( ~ cR
| cK
| cM
| cG )
& ( ~ cE
| cK
| ~ cG
| cN
| ~ cM ) ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(17,plain,
( ~ cF
| cB ),
inference(cnf,[status(esa)],[4]) ).
thf(16,plain,
( ~ cG
| cK
| cM
| ~ cB ),
inference(cnf,[status(esa)],[4]) ).
thf(19,plain,
( cG
| cR
| cK ),
inference(cnf,[status(esa)],[4]) ).
thf(22,plain,
( ~ cL
| ~ cM
| cC ),
inference(cnf,[status(esa)],[4]) ).
thf(12,plain,
cL,
inference(cnf,[status(esa)],[4]) ).
thf(43,plain,
( ~ $true
| ~ cM
| cC ),
inference(rewrite,[status(thm)],[22,12]) ).
thf(44,plain,
( ~ cM
| cC ),
inference(simp,[status(thm)],[43]) ).
thf(10,plain,
( ~ cR
| ~ cE
| ~ cC ),
inference(cnf,[status(esa)],[4]) ).
thf(18,plain,
cE,
inference(cnf,[status(esa)],[4]) ).
thf(23,plain,
( ~ cR
| ~ $true
| ~ cC ),
inference(rewrite,[status(thm)],[10,18]) ).
thf(24,plain,
( ~ cR
| ~ cC ),
inference(simp,[status(thm)],[23]) ).
thf(45,plain,
( ~ cM
| ~ cR
| ( cC != cC ) ),
inference(paramod_ordered,[status(thm)],[44,24]) ).
thf(46,plain,
( ~ cM
| ~ cR ),
inference(pattern_uni,[status(thm)],[45:[]]) ).
thf(49,plain,
( cG
| cK
| ~ cM
| ( cR != cR ) ),
inference(paramod_ordered,[status(thm)],[19,46]) ).
thf(50,plain,
( cG
| cK
| ~ cM ),
inference(pattern_uni,[status(thm)],[49:[]]) ).
thf(6,plain,
( ~ cK
| ~ cL
| ~ cE
| ~ cM ),
inference(cnf,[status(esa)],[4]) ).
thf(25,plain,
( ~ cK
| ~ $true
| ~ $true
| ~ cM ),
inference(rewrite,[status(thm)],[6,18,12]) ).
thf(26,plain,
( ~ cK
| ~ cM ),
inference(simp,[status(thm)],[25]) ).
thf(85,plain,
( cG
| ~ cM
| ( cK != cK ) ),
inference(paramod_ordered,[status(thm)],[50,26]) ).
thf(86,plain,
( cG
| ~ cM ),
inference(pattern_uni,[status(thm)],[85:[]]) ).
thf(7,plain,
( ~ cE
| cK
| ~ cG
| cN
| ~ cM ),
inference(cnf,[status(esa)],[4]) ).
thf(33,plain,
( ~ $true
| cK
| ~ cG
| cN
| ~ cM ),
inference(rewrite,[status(thm)],[7,18]) ).
thf(34,plain,
( cK
| ~ cG
| cN
| ~ cM ),
inference(simp,[status(thm)],[33]) ).
thf(37,plain,
( ~ cG
| cN
| ~ cM
| ( cK != cK ) ),
inference(paramod_ordered,[status(thm)],[34,26]) ).
thf(38,plain,
( ~ cG
| cN
| ~ cM ),
inference(pattern_uni,[status(thm)],[37:[]]) ).
thf(93,plain,
( ~ cM
| cN
| ( cG != cG ) ),
inference(paramod_ordered,[status(thm)],[86,38]) ).
thf(94,plain,
( ~ cM
| cN ),
inference(pattern_uni,[status(thm)],[93:[]]) ).
thf(14,plain,
( cK
| ~ cN
| ~ cM
| cF ),
inference(cnf,[status(esa)],[4]) ).
thf(117,plain,
( ~ cM
| cK
| cF
| ( cN != cN ) ),
inference(paramod_ordered,[status(thm)],[94,14]) ).
thf(118,plain,
( ~ cM
| cK
| cF ),
inference(pattern_uni,[status(thm)],[117:[]]) ).
thf(13,plain,
( ~ cG
| ~ cB
| cR
| ~ cC ),
inference(cnf,[status(esa)],[4]) ).
thf(53,plain,
( ~ cM
| ~ cG
| ~ cB
| cR
| ( cC != cC ) ),
inference(paramod_ordered,[status(thm)],[44,13]) ).
thf(54,plain,
( ~ cM
| ~ cG
| ~ cB
| cR ),
inference(pattern_uni,[status(thm)],[53:[]]) ).
thf(97,plain,
( ~ cM
| ~ cB
| cR
| ( cG != cG ) ),
inference(paramod_ordered,[status(thm)],[86,54]) ).
thf(98,plain,
( ~ cM
| ~ cB
| cR ),
inference(pattern_uni,[status(thm)],[97:[]]) ).
thf(125,plain,
( ~ cF
| ~ cM
| cR
| ( cB != cB ) ),
inference(paramod_ordered,[status(thm)],[17,98]) ).
thf(126,plain,
( ~ cF
| ~ cM
| cR ),
inference(pattern_uni,[status(thm)],[125:[]]) ).
thf(135,plain,
( ~ cM
| cK
| cR
| ( cF != cF ) ),
inference(paramod_ordered,[status(thm)],[118,126]) ).
thf(136,plain,
( ~ cM
| cK
| cR ),
inference(pattern_uni,[status(thm)],[135:[]]) ).
thf(165,plain,
( ~ cM
| cK
| ( cR != cR ) ),
inference(paramod_ordered,[status(thm)],[136,46]) ).
thf(166,plain,
( ~ cM
| cK ),
inference(pattern_uni,[status(thm)],[165:[]]) ).
thf(177,plain,
( ~ cM
| ( cK != cK ) ),
inference(paramod_ordered,[status(thm)],[166,26]) ).
thf(178,plain,
~ cM,
inference(pattern_uni,[status(thm)],[177:[]]) ).
thf(189,plain,
( ~ cG
| cK
| $false
| ~ cB ),
inference(rewrite,[status(thm)],[16,178]) ).
thf(190,plain,
( ~ cG
| cK
| ~ cB ),
inference(simp,[status(thm)],[189]) ).
thf(238,plain,
( ~ cF
| ~ cG
| cK
| ( cB != cB ) ),
inference(paramod_ordered,[status(thm)],[17,190]) ).
thf(239,plain,
( ~ cF
| ~ cG
| cK ),
inference(pattern_uni,[status(thm)],[238:[]]) ).
thf(20,plain,
( ~ cN
| cP
| cF
| cC ),
inference(cnf,[status(esa)],[4]) ).
thf(15,plain,
( ~ cL
| ~ cP
| cM ),
inference(cnf,[status(esa)],[4]) ).
thf(39,plain,
( ~ $true
| ~ cP
| cM ),
inference(rewrite,[status(thm)],[15,12]) ).
thf(40,plain,
( ~ cP
| cM ),
inference(simp,[status(thm)],[39]) ).
thf(193,plain,
( ~ cP
| $false ),
inference(rewrite,[status(thm)],[40,178]) ).
thf(194,plain,
~ cP,
inference(simp,[status(thm)],[193]) ).
thf(217,plain,
( ~ cN
| $false
| cF
| cC ),
inference(rewrite,[status(thm)],[20,194]) ).
thf(218,plain,
( ~ cN
| cF
| cC ),
inference(simp,[status(thm)],[217]) ).
thf(5,plain,
( cG
| cP
| cR ),
inference(cnf,[status(esa)],[4]) ).
thf(41,plain,
( cG
| cR
| cM
| ( cP != cP ) ),
inference(paramod_ordered,[status(thm)],[5,40]) ).
thf(42,plain,
( cG
| cR
| cM ),
inference(pattern_uni,[status(thm)],[41:[]]) ).
thf(61,plain,
( cG
| cM
| ~ cC
| ( cR != cR ) ),
inference(paramod_ordered,[status(thm)],[42,24]) ).
thf(62,plain,
( cG
| cM
| ~ cC ),
inference(pattern_uni,[status(thm)],[61:[]]) ).
thf(199,plain,
( cG
| $false
| ~ cC ),
inference(rewrite,[status(thm)],[62,178]) ).
thf(200,plain,
( cG
| ~ cC ),
inference(simp,[status(thm)],[199]) ).
thf(223,plain,
( ~ cN
| cF
| cG
| ( cC != cC ) ),
inference(paramod_ordered,[status(thm)],[218,200]) ).
thf(224,plain,
( ~ cN
| cF
| cG ),
inference(pattern_uni,[status(thm)],[223:[]]) ).
thf(195,plain,
( cG
| cR
| $false ),
inference(rewrite,[status(thm)],[42,178]) ).
thf(196,plain,
( cG
| cR ),
inference(simp,[status(thm)],[195]) ).
thf(21,plain,
( ~ cR
| cK
| cM
| cG ),
inference(cnf,[status(esa)],[4]) ).
thf(252,plain,
( ~ cR
| cK
| $false
| cG ),
inference(rewrite,[status(thm)],[21,178]) ).
thf(253,plain,
( ~ cR
| cK
| cG ),
inference(simp,[status(thm)],[252]) ).
thf(254,plain,
( cG
| cK
| ( cR != cR ) ),
inference(paramod_ordered,[status(thm)],[196,253]) ).
thf(255,plain,
( cG
| cK ),
inference(pattern_uni,[status(thm)],[254:[]]) ).
thf(9,plain,
( ~ cK
| ~ cB
| cC ),
inference(cnf,[status(esa)],[4]) ).
thf(29,plain,
( ~ cF
| ~ cK
| cC
| ( cB != cB ) ),
inference(paramod_ordered,[status(thm)],[17,9]) ).
thf(30,plain,
( ~ cF
| ~ cK
| cC ),
inference(pattern_uni,[status(thm)],[29:[]]) ).
thf(67,plain,
( ~ cF
| ~ cK
| ~ cR
| ( cC != cC ) ),
inference(paramod_ordered,[status(thm)],[30,24]) ).
thf(68,plain,
( ~ cF
| ~ cK
| ~ cR ),
inference(pattern_uni,[status(thm)],[67:[]]) ).
thf(211,plain,
( cG
| ~ cF
| ~ cK
| ( cR != cR ) ),
inference(paramod_ordered,[status(thm)],[196,68]) ).
thf(212,plain,
( cG
| ~ cF
| ~ cK ),
inference(pattern_uni,[status(thm)],[211:[]]) ).
thf(270,plain,
( cG
| ~ cF
| ( cK != cK ) ),
inference(paramod_ordered,[status(thm)],[255,212]) ).
thf(271,plain,
( cG
| ~ cF ),
inference(pattern_uni,[status(thm)],[270:[]]) ).
thf(352,plain,
( ~ cN
| cG
| ( cF != cF ) ),
inference(paramod_ordered,[status(thm)],[224,271]) ).
thf(353,plain,
( ~ cN
| cG ),
inference(pattern_uni,[status(thm)],[352:[]]) ).
thf(8,plain,
( ~ cR
| cN
| cF
| cP ),
inference(cnf,[status(esa)],[4]) ).
thf(77,plain,
( cG
| cM
| cN
| cF
| cP
| ( cR != cR ) ),
inference(paramod_ordered,[status(thm)],[42,8]) ).
thf(78,plain,
( cG
| cM
| cN
| cF
| cP ),
inference(pattern_uni,[status(thm)],[77:[]]) ).
thf(109,plain,
( cG
| cM
| cN
| cF
| ( cP != cP ) ),
inference(paramod_ordered,[status(thm)],[78,40]) ).
thf(110,plain,
( cG
| cM
| cN
| cF ),
inference(pattern_uni,[status(thm)],[109:[]]) ).
thf(187,plain,
( cG
| $false
| cN
| cF ),
inference(rewrite,[status(thm)],[110,178]) ).
thf(188,plain,
( cG
| cN
| cF ),
inference(simp,[status(thm)],[187]) ).
thf(274,plain,
( cG
| cN
| ( cF != cF ) ),
inference(paramod_ordered,[status(thm)],[188,271]) ).
thf(275,plain,
( cG
| cN ),
inference(pattern_uni,[status(thm)],[274:[]]) ).
thf(11,plain,
( ~ cG
| cR
| cM ),
inference(cnf,[status(esa)],[4]) ).
thf(191,plain,
( ~ cG
| cR
| $false ),
inference(rewrite,[status(thm)],[11,178]) ).
thf(192,plain,
( ~ cG
| cR ),
inference(simp,[status(thm)],[191]) ).
thf(278,plain,
( cN
| cR
| ( cG != cG ) ),
inference(paramod_ordered,[status(thm)],[275,192]) ).
thf(279,plain,
( cN
| cR ),
inference(pattern_uni,[status(thm)],[278:[]]) ).
thf(203,plain,
( ~ cR
| cN
| cF
| $false ),
inference(rewrite,[status(thm)],[8,194]) ).
thf(204,plain,
( ~ cR
| cN
| cF ),
inference(simp,[status(thm)],[203]) ).
thf(287,plain,
( cN
| cF
| ( cR != cR ) ),
inference(paramod_ordered,[status(thm)],[279,204]) ).
thf(288,plain,
( cN
| cF ),
inference(pattern_uni,[status(thm)],[287:[]]) ).
thf(296,plain,
( cN
| cB
| ( cF != cF ) ),
inference(paramod_ordered,[status(thm)],[288,17]) ).
thf(297,plain,
( cN
| cB ),
inference(pattern_uni,[status(thm)],[296:[]]) ).
thf(282,plain,
( cN
| cK
| ~ cB
| ( cG != cG ) ),
inference(paramod_ordered,[status(thm)],[275,190]) ).
thf(283,plain,
( cN
| cK
| ~ cB ),
inference(pattern_uni,[status(thm)],[282:[]]) ).
thf(434,plain,
( cN
| cK
| ( cB != cB ) ),
inference(paramod_ordered,[status(thm)],[297,283]) ).
thf(435,plain,
( cN
| cK ),
inference(pattern_uni,[status(thm)],[434:[]]) ).
thf(250,plain,
( ~ cR
| cN
| ~ cK
| ( cF != cF ) ),
inference(paramod_ordered,[status(thm)],[204,68]) ).
thf(251,plain,
( ~ cR
| cN
| ~ cK ),
inference(pattern_uni,[status(thm)],[250:[]]) ).
thf(416,plain,
( cN
| ~ cK
| ( cR != cR ) ),
inference(paramod_ordered,[status(thm)],[279,251]) ).
thf(417,plain,
( cN
| ~ cK ),
inference(pattern_uni,[status(thm)],[416:[]]) ).
thf(440,plain,
( cN
| ( cK != cK ) ),
inference(paramod_ordered,[status(thm)],[435,417]) ).
thf(441,plain,
cN,
inference(pattern_uni,[status(thm)],[440:[]]) ).
thf(450,plain,
( ~ $true
| cG ),
inference(rewrite,[status(thm)],[353,441]) ).
thf(451,plain,
cG,
inference(simp,[status(thm)],[450]) ).
thf(468,plain,
( ~ cF
| ~ $true
| cK ),
inference(rewrite,[status(thm)],[239,451]) ).
thf(469,plain,
( ~ cF
| cK ),
inference(simp,[status(thm)],[468]) ).
thf(31,plain,
( ~ cG
| cM
| ~ cC
| ( cR != cR ) ),
inference(paramod_ordered,[status(thm)],[11,24]) ).
thf(32,plain,
( ~ cG
| cM
| ~ cC ),
inference(pattern_uni,[status(thm)],[31:[]]) ).
thf(197,plain,
( ~ cG
| $false
| ~ cC ),
inference(rewrite,[status(thm)],[32,178]) ).
thf(198,plain,
( ~ cG
| ~ cC ),
inference(simp,[status(thm)],[197]) ).
thf(221,plain,
( ~ cN
| cF
| ~ cG
| ( cC != cC ) ),
inference(paramod_ordered,[status(thm)],[218,198]) ).
thf(222,plain,
( ~ cN
| cF
| ~ cG ),
inference(pattern_uni,[status(thm)],[221:[]]) ).
thf(365,plain,
( ~ cN
| cF
| ( cG != cG ) ),
inference(paramod_ordered,[status(thm)],[353,222]) ).
thf(366,plain,
( ~ cN
| cF ),
inference(pattern_uni,[status(thm)],[365:[]]) ).
thf(458,plain,
( ~ $true
| cF ),
inference(rewrite,[status(thm)],[366,441]) ).
thf(459,plain,
cF,
inference(simp,[status(thm)],[458]) ).
thf(219,plain,
( ~ cN
| cF
| ~ cR
| ( cC != cC ) ),
inference(paramod_ordered,[status(thm)],[218,24]) ).
thf(220,plain,
( ~ cN
| cF
| ~ cR ),
inference(pattern_uni,[status(thm)],[219:[]]) ).
thf(324,plain,
( ~ cN
| ~ cR
| ~ cK
| ( cF != cF ) ),
inference(paramod_ordered,[status(thm)],[220,68]) ).
thf(325,plain,
( ~ cN
| ~ cR
| ~ cK ),
inference(pattern_uni,[status(thm)],[324:[]]) ).
thf(328,plain,
( ~ cG
| ~ cN
| ~ cK
| ( cR != cR ) ),
inference(paramod_ordered,[status(thm)],[192,325]) ).
thf(329,plain,
( ~ cG
| ~ cN
| ~ cK ),
inference(pattern_uni,[status(thm)],[328:[]]) ).
thf(361,plain,
( ~ cN
| ~ cK
| ( cG != cG ) ),
inference(paramod_ordered,[status(thm)],[353,329]) ).
thf(362,plain,
( ~ cN
| ~ cK ),
inference(pattern_uni,[status(thm)],[361:[]]) ).
thf(460,plain,
( ~ $true
| ~ cK ),
inference(rewrite,[status(thm)],[362,441]) ).
thf(461,plain,
~ cK,
inference(simp,[status(thm)],[460]) ).
thf(482,plain,
( ~ $true
| $false ),
inference(rewrite,[status(thm)],[469,459,461]) ).
thf(483,plain,
$false,
inference(simp,[status(thm)],[482]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SYO178^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.12 % Command : run_Leo-III %s %d
% 0.12/0.33 % Computer : n020.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 : Mon May 20 08:46:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 1.00/0.97 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.37/1.14 % [INFO] Parsing done (163ms).
% 1.37/1.15 % [INFO] Running in sequential loop mode.
% 1.84/1.52 % [INFO] nitpick registered as external prover.
% 1.84/1.53 % [INFO] Scanning for conjecture ...
% 2.10/1.64 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.32/1.68 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.32/1.68 % [INFO] Problem is higher-order (TPTP THF).
% 2.32/1.69 % [INFO] Type checking passed.
% 2.32/1.69 % [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.56/2.97 % [INFO] Killing All external provers ...
% 7.56/2.97 % Time passed: 2486ms (effective reasoning time: 1813ms)
% 7.56/2.97 % 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.56/2.97 % Axioms used in derivation (0):
% 7.56/2.97 % No. of inferences in proof: 142
% 7.56/2.97 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2486 ms resp. 1813 ms w/o parsing
% 7.56/3.04 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.56/3.04 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------