TSTP Solution File: GEO124+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO124+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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 06:13:13 EDT 2024
% Result : Theorem 4.05s 1.19s
% Output : CNFRefutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 67 ( 12 unt; 0 def)
% Number of atoms : 290 ( 42 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 340 ( 117 ~; 110 |; 90 &)
% ( 10 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 204 ( 5 sgn 140 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X0,X2,X4,X6] :
( between_c(X0,X2,X4,X6)
<=> ( ? [X7] :
( inner_point(X4,X7)
& end_point(X6,X7)
& end_point(X2,X7)
& part_of(X7,X0) )
& X2 != X6 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',between_c_defn) ).
fof(f18,axiom,
! [X8,X2,X4,X6] :
( between_o(X8,X2,X4,X6)
<=> ( ( ordered_by(X8,X4,X2)
& ordered_by(X8,X6,X4) )
| ( ordered_by(X8,X4,X6)
& ordered_by(X8,X2,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',between_o_defn) ).
fof(f19,axiom,
! [X2,X8] :
( start_point(X2,X8)
<=> ( ! [X4] :
( ( incident_o(X4,X8)
& X2 != X4 )
=> ordered_by(X8,X2,X4) )
& incident_o(X2,X8) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',start_point_defn) ).
fof(f21,axiom,
! [X8,X2,X4] :
( ordered_by(X8,X2,X4)
=> ( incident_o(X4,X8)
& incident_o(X2,X8) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',o1) ).
fof(f23,axiom,
! [X2,X4,X6,X8] :
( between_o(X8,X2,X4,X6)
<=> ? [X0] :
( between_c(X0,X2,X4,X6)
& ! [X2] :
( incident_o(X2,X8)
<=> incident_c(X2,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',o3) ).
fof(f28,conjecture,
! [X8,X2,X4] :
( ( start_point(X4,X8)
& start_point(X2,X8) )
=> X2 = X4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_4_10_1) ).
fof(f29,negated_conjecture,
~ ! [X8,X2,X4] :
( ( start_point(X4,X8)
& start_point(X2,X8) )
=> X2 = X4 ),
inference(negated_conjecture,[],[f28]) ).
fof(f43,plain,
! [X0,X1,X2,X3] :
( between_c(X0,X1,X2,X3)
<=> ( ? [X4] :
( inner_point(X2,X4)
& end_point(X3,X4)
& end_point(X1,X4)
& part_of(X4,X0) )
& X1 != X3 ) ),
inference(rectify,[],[f17]) ).
fof(f44,plain,
! [X0,X1,X2,X3] :
( between_o(X0,X1,X2,X3)
<=> ( ( ordered_by(X0,X2,X1)
& ordered_by(X0,X3,X2) )
| ( ordered_by(X0,X2,X3)
& ordered_by(X0,X1,X2) ) ) ),
inference(rectify,[],[f18]) ).
fof(f45,plain,
! [X0,X1] :
( start_point(X0,X1)
<=> ( ! [X2] :
( ( incident_o(X2,X1)
& X0 != X2 )
=> ordered_by(X1,X0,X2) )
& incident_o(X0,X1) ) ),
inference(rectify,[],[f19]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ordered_by(X0,X1,X2)
=> ( incident_o(X2,X0)
& incident_o(X1,X0) ) ),
inference(rectify,[],[f21]) ).
fof(f49,plain,
! [X0,X1,X2,X3] :
( between_o(X3,X0,X1,X2)
<=> ? [X4] :
( between_c(X4,X0,X1,X2)
& ! [X5] :
( incident_o(X5,X3)
<=> incident_c(X5,X4) ) ) ),
inference(rectify,[],[f23]) ).
fof(f54,plain,
~ ! [X0,X1,X2] :
( ( start_point(X2,X0)
& start_point(X1,X0) )
=> X1 = X2 ),
inference(rectify,[],[f29]) ).
fof(f55,plain,
! [X0,X1] :
( start_point(X0,X1)
=> ( ! [X2] :
( ( incident_o(X2,X1)
& X0 != X2 )
=> ordered_by(X1,X0,X2) )
& incident_o(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f45]) ).
fof(f75,plain,
! [X0,X1] :
( ( ! [X2] :
( ordered_by(X1,X0,X2)
| ~ incident_o(X2,X1)
| X0 = X2 )
& incident_o(X0,X1) )
| ~ start_point(X0,X1) ),
inference(ennf_transformation,[],[f55]) ).
fof(f76,plain,
! [X0,X1] :
( ( ! [X2] :
( ordered_by(X1,X0,X2)
| ~ incident_o(X2,X1)
| X0 = X2 )
& incident_o(X0,X1) )
| ~ start_point(X0,X1) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
! [X0,X1,X2] :
( ( incident_o(X2,X0)
& incident_o(X1,X0) )
| ~ ordered_by(X0,X1,X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f81,plain,
? [X0,X1,X2] :
( X1 != X2
& start_point(X2,X0)
& start_point(X1,X0) ),
inference(ennf_transformation,[],[f54]) ).
fof(f82,plain,
? [X0,X1,X2] :
( X1 != X2
& start_point(X2,X0)
& start_point(X1,X0) ),
inference(flattening,[],[f81]) ).
fof(f122,plain,
! [X0,X1,X2,X3] :
( ( between_c(X0,X1,X2,X3)
| ! [X4] :
( ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0) )
| X1 = X3 )
& ( ( ? [X4] :
( inner_point(X2,X4)
& end_point(X3,X4)
& end_point(X1,X4)
& part_of(X4,X0) )
& X1 != X3 )
| ~ between_c(X0,X1,X2,X3) ) ),
inference(nnf_transformation,[],[f43]) ).
fof(f123,plain,
! [X0,X1,X2,X3] :
( ( between_c(X0,X1,X2,X3)
| ! [X4] :
( ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0) )
| X1 = X3 )
& ( ( ? [X4] :
( inner_point(X2,X4)
& end_point(X3,X4)
& end_point(X1,X4)
& part_of(X4,X0) )
& X1 != X3 )
| ~ between_c(X0,X1,X2,X3) ) ),
inference(flattening,[],[f122]) ).
fof(f124,plain,
! [X0,X1,X2,X3] :
( ( between_c(X0,X1,X2,X3)
| ! [X4] :
( ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0) )
| X1 = X3 )
& ( ( ? [X5] :
( inner_point(X2,X5)
& end_point(X3,X5)
& end_point(X1,X5)
& part_of(X5,X0) )
& X1 != X3 )
| ~ between_c(X0,X1,X2,X3) ) ),
inference(rectify,[],[f123]) ).
fof(f125,plain,
! [X0,X1,X2,X3] :
( ? [X5] :
( inner_point(X2,X5)
& end_point(X3,X5)
& end_point(X1,X5)
& part_of(X5,X0) )
=> ( inner_point(X2,sK13(X0,X1,X2,X3))
& end_point(X3,sK13(X0,X1,X2,X3))
& end_point(X1,sK13(X0,X1,X2,X3))
& part_of(sK13(X0,X1,X2,X3),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
! [X0,X1,X2,X3] :
( ( between_c(X0,X1,X2,X3)
| ! [X4] :
( ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0) )
| X1 = X3 )
& ( ( inner_point(X2,sK13(X0,X1,X2,X3))
& end_point(X3,sK13(X0,X1,X2,X3))
& end_point(X1,sK13(X0,X1,X2,X3))
& part_of(sK13(X0,X1,X2,X3),X0)
& X1 != X3 )
| ~ between_c(X0,X1,X2,X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f124,f125]) ).
fof(f127,plain,
! [X0,X1,X2,X3] :
( ( between_o(X0,X1,X2,X3)
| ( ( ~ ordered_by(X0,X2,X1)
| ~ ordered_by(X0,X3,X2) )
& ( ~ ordered_by(X0,X2,X3)
| ~ ordered_by(X0,X1,X2) ) ) )
& ( ( ordered_by(X0,X2,X1)
& ordered_by(X0,X3,X2) )
| ( ordered_by(X0,X2,X3)
& ordered_by(X0,X1,X2) )
| ~ between_o(X0,X1,X2,X3) ) ),
inference(nnf_transformation,[],[f44]) ).
fof(f128,plain,
! [X0,X1,X2,X3] :
( ( between_o(X0,X1,X2,X3)
| ( ( ~ ordered_by(X0,X2,X1)
| ~ ordered_by(X0,X3,X2) )
& ( ~ ordered_by(X0,X2,X3)
| ~ ordered_by(X0,X1,X2) ) ) )
& ( ( ordered_by(X0,X2,X1)
& ordered_by(X0,X3,X2) )
| ( ordered_by(X0,X2,X3)
& ordered_by(X0,X1,X2) )
| ~ between_o(X0,X1,X2,X3) ) ),
inference(flattening,[],[f127]) ).
fof(f132,plain,
! [X0,X1,X2,X3] :
( ( between_o(X3,X0,X1,X2)
| ! [X4] :
( ~ between_c(X4,X0,X1,X2)
| ? [X5] :
( ( ~ incident_c(X5,X4)
| ~ incident_o(X5,X3) )
& ( incident_c(X5,X4)
| incident_o(X5,X3) ) ) ) )
& ( ? [X4] :
( between_c(X4,X0,X1,X2)
& ! [X5] :
( ( incident_o(X5,X3)
| ~ incident_c(X5,X4) )
& ( incident_c(X5,X4)
| ~ incident_o(X5,X3) ) ) )
| ~ between_o(X3,X0,X1,X2) ) ),
inference(nnf_transformation,[],[f49]) ).
fof(f133,plain,
! [X0,X1,X2,X3] :
( ( between_o(X3,X0,X1,X2)
| ! [X4] :
( ~ between_c(X4,X0,X1,X2)
| ? [X5] :
( ( ~ incident_c(X5,X4)
| ~ incident_o(X5,X3) )
& ( incident_c(X5,X4)
| incident_o(X5,X3) ) ) ) )
& ( ? [X6] :
( between_c(X6,X0,X1,X2)
& ! [X7] :
( ( incident_o(X7,X3)
| ~ incident_c(X7,X6) )
& ( incident_c(X7,X6)
| ~ incident_o(X7,X3) ) ) )
| ~ between_o(X3,X0,X1,X2) ) ),
inference(rectify,[],[f132]) ).
fof(f134,plain,
! [X3,X4] :
( ? [X5] :
( ( ~ incident_c(X5,X4)
| ~ incident_o(X5,X3) )
& ( incident_c(X5,X4)
| incident_o(X5,X3) ) )
=> ( ( ~ incident_c(sK15(X3,X4),X4)
| ~ incident_o(sK15(X3,X4),X3) )
& ( incident_c(sK15(X3,X4),X4)
| incident_o(sK15(X3,X4),X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
! [X0,X1,X2,X3] :
( ? [X6] :
( between_c(X6,X0,X1,X2)
& ! [X7] :
( ( incident_o(X7,X3)
| ~ incident_c(X7,X6) )
& ( incident_c(X7,X6)
| ~ incident_o(X7,X3) ) ) )
=> ( between_c(sK16(X0,X1,X2,X3),X0,X1,X2)
& ! [X7] :
( ( incident_o(X7,X3)
| ~ incident_c(X7,sK16(X0,X1,X2,X3)) )
& ( incident_c(X7,sK16(X0,X1,X2,X3))
| ~ incident_o(X7,X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
! [X0,X1,X2,X3] :
( ( between_o(X3,X0,X1,X2)
| ! [X4] :
( ~ between_c(X4,X0,X1,X2)
| ( ( ~ incident_c(sK15(X3,X4),X4)
| ~ incident_o(sK15(X3,X4),X3) )
& ( incident_c(sK15(X3,X4),X4)
| incident_o(sK15(X3,X4),X3) ) ) ) )
& ( ( between_c(sK16(X0,X1,X2,X3),X0,X1,X2)
& ! [X7] :
( ( incident_o(X7,X3)
| ~ incident_c(X7,sK16(X0,X1,X2,X3)) )
& ( incident_c(X7,sK16(X0,X1,X2,X3))
| ~ incident_o(X7,X3) ) ) )
| ~ between_o(X3,X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15,sK16])],[f133,f135,f134]) ).
fof(f149,plain,
( ? [X0,X1,X2] :
( X1 != X2
& start_point(X2,X0)
& start_point(X1,X0) )
=> ( sK23 != sK24
& start_point(sK24,sK22)
& start_point(sK23,sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
( sK23 != sK24
& start_point(sK24,sK22)
& start_point(sK23,sK22) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK22,sK23,sK24])],[f82,f149]) ).
fof(f193,plain,
! [X2,X3,X0,X1] :
( X1 != X3
| ~ between_c(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f126]) ).
fof(f204,plain,
! [X2,X3,X0,X1] :
( between_o(X0,X1,X2,X3)
| ~ ordered_by(X0,X2,X1)
| ~ ordered_by(X0,X3,X2) ),
inference(cnf_transformation,[],[f128]) ).
fof(f205,plain,
! [X0,X1] :
( incident_o(X0,X1)
| ~ start_point(X0,X1) ),
inference(cnf_transformation,[],[f76]) ).
fof(f206,plain,
! [X2,X0,X1] :
( ordered_by(X1,X0,X2)
| ~ incident_o(X2,X1)
| X0 = X2
| ~ start_point(X0,X1) ),
inference(cnf_transformation,[],[f76]) ).
fof(f207,plain,
! [X2,X0,X1] :
( incident_o(X1,X0)
| ~ ordered_by(X0,X1,X2) ),
inference(cnf_transformation,[],[f77]) ).
fof(f214,plain,
! [X2,X3,X0,X1] :
( between_c(sK16(X0,X1,X2,X3),X0,X1,X2)
| ~ between_o(X3,X0,X1,X2) ),
inference(cnf_transformation,[],[f136]) ).
fof(f227,plain,
start_point(sK23,sK22),
inference(cnf_transformation,[],[f150]) ).
fof(f228,plain,
start_point(sK24,sK22),
inference(cnf_transformation,[],[f150]) ).
fof(f229,plain,
sK23 != sK24,
inference(cnf_transformation,[],[f150]) ).
fof(f234,plain,
! [X2,X3,X0] : ~ between_c(X0,X3,X2,X3),
inference(equality_resolution,[],[f193]) ).
cnf(c_96,plain,
~ between_c(X0,X1,X2,X1),
inference(cnf_transformation,[],[f234]) ).
cnf(c_97,plain,
( ~ ordered_by(X0,X1,X2)
| ~ ordered_by(X0,X2,X3)
| between_o(X0,X3,X2,X1) ),
inference(cnf_transformation,[],[f204]) ).
cnf(c_103,plain,
( ~ incident_o(X0,X1)
| ~ start_point(X2,X1)
| X0 = X2
| ordered_by(X1,X2,X0) ),
inference(cnf_transformation,[],[f206]) ).
cnf(c_104,plain,
( ~ start_point(X0,X1)
| incident_o(X0,X1) ),
inference(cnf_transformation,[],[f205]) ).
cnf(c_106,plain,
( ~ ordered_by(X0,X1,X2)
| incident_o(X1,X0) ),
inference(cnf_transformation,[],[f207]) ).
cnf(c_112,plain,
( ~ between_o(X0,X1,X2,X3)
| between_c(sK16(X1,X2,X3,X0),X1,X2,X3) ),
inference(cnf_transformation,[],[f214]) ).
cnf(c_125,negated_conjecture,
sK23 != sK24,
inference(cnf_transformation,[],[f229]) ).
cnf(c_126,negated_conjecture,
start_point(sK24,sK22),
inference(cnf_transformation,[],[f228]) ).
cnf(c_127,negated_conjecture,
start_point(sK23,sK22),
inference(cnf_transformation,[],[f227]) ).
cnf(c_250,plain,
( incident_o(X0,X1)
| ~ start_point(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_104]) ).
cnf(c_251,plain,
( ~ start_point(X0,X1)
| incident_o(X0,X1) ),
inference(renaming,[status(thm)],[c_250]) ).
cnf(c_1396,plain,
( X0 != sK22
| X1 != sK24
| ~ incident_o(X2,X0)
| X1 = X2
| ordered_by(X0,X1,X2) ),
inference(resolution_lifted,[status(thm)],[c_103,c_126]) ).
cnf(c_1397,plain,
( ~ incident_o(X0,sK22)
| sK24 = X0
| ordered_by(sK22,sK24,X0) ),
inference(unflattening,[status(thm)],[c_1396]) ).
cnf(c_1408,plain,
( X0 != sK22
| X1 != sK23
| ~ incident_o(X2,X0)
| X1 = X2
| ordered_by(X0,X1,X2) ),
inference(resolution_lifted,[status(thm)],[c_103,c_127]) ).
cnf(c_1409,plain,
( ~ incident_o(X0,sK22)
| sK23 = X0
| ordered_by(sK22,sK23,X0) ),
inference(unflattening,[status(thm)],[c_1408]) ).
cnf(c_1426,plain,
( X0 != sK24
| X1 != sK22
| incident_o(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_251,c_126]) ).
cnf(c_1427,plain,
incident_o(sK24,sK22),
inference(unflattening,[status(thm)],[c_1426]) ).
cnf(c_4267,negated_conjecture,
sK23 != sK24,
inference(demodulation,[status(thm)],[c_125]) ).
cnf(c_7813,plain,
~ between_o(X0,X1,X2,X1),
inference(superposition,[status(thm)],[c_112,c_96]) ).
cnf(c_7893,plain,
( ~ ordered_by(X0,X1,X2)
| ~ ordered_by(X0,X2,X1) ),
inference(superposition,[status(thm)],[c_97,c_7813]) ).
cnf(c_7922,plain,
( ~ ordered_by(sK22,X0,sK24)
| ~ incident_o(X0,sK22)
| X0 = sK24 ),
inference(superposition,[status(thm)],[c_1397,c_7893]) ).
cnf(c_7947,plain,
( ~ ordered_by(sK22,X0,sK24)
| X0 = sK24 ),
inference(forward_subsumption_resolution,[status(thm)],[c_7922,c_106]) ).
cnf(c_7955,plain,
( ~ incident_o(sK24,sK22)
| sK23 = sK24 ),
inference(superposition,[status(thm)],[c_1409,c_7947]) ).
cnf(c_7956,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7955,c_4267,c_1427]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO124+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n023.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 : Fri Jun 21 09:39:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.05/1.19 % SZS status Started for theBenchmark.p
% 4.05/1.19 % SZS status Theorem for theBenchmark.p
% 4.05/1.19
% 4.05/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.05/1.19
% 4.05/1.19 ------ iProver source info
% 4.05/1.19
% 4.05/1.19 git: date: 2024-06-12 09:56:46 +0000
% 4.05/1.19 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 4.05/1.19 git: non_committed_changes: false
% 4.05/1.19
% 4.05/1.19 ------ Parsing...
% 4.05/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.05/1.19
% 4.05/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e
% 4.05/1.19
% 4.05/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.05/1.19
% 4.05/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.05/1.19 ------ Proving...
% 4.05/1.19 ------ Problem Properties
% 4.05/1.19
% 4.05/1.19
% 4.05/1.19 clauses 80
% 4.05/1.19 conjectures 1
% 4.05/1.19 EPR 29
% 4.05/1.19 Horn 50
% 4.05/1.19 unary 7
% 4.05/1.19 binary 28
% 4.05/1.19 lits 235
% 4.05/1.19 lits eq 24
% 4.05/1.19 fd_pure 0
% 4.05/1.19 fd_pseudo 0
% 4.05/1.19 fd_cond 2
% 4.05/1.19 fd_pseudo_cond 16
% 4.05/1.19 AC symbols 0
% 4.05/1.19
% 4.05/1.19 ------ Schedule dynamic 5 is on
% 4.05/1.19
% 4.05/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.05/1.19
% 4.05/1.19
% 4.05/1.19 ------
% 4.05/1.19 Current options:
% 4.05/1.19 ------
% 4.05/1.19
% 4.05/1.19
% 4.05/1.19
% 4.05/1.19
% 4.05/1.19 ------ Proving...
% 4.05/1.19
% 4.05/1.19
% 4.05/1.19 % SZS status Theorem for theBenchmark.p
% 4.05/1.19
% 4.05/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.05/1.19
% 4.05/1.19
%------------------------------------------------------------------------------