TSTP Solution File: SWC400+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC400+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : Thu Aug 31 20:43:08 EDT 2023
% Result : Theorem 47.74s 7.23s
% Output : CNFRefutation 47.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 66 ( 20 unt; 0 def)
% Number of atoms : 349 ( 44 equ)
% Maximal formula atoms : 22 ( 5 avg)
% Number of connectives : 428 ( 145 ~; 130 |; 125 &)
% ( 4 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 130 ( 0 sgn; 60 !; 47 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax7) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax36) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ( memberP(X1,X4)
| ~ memberP(X0,X4) ) )
| ~ totalorderedP(X2)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ( memberP(X1,X4)
| ~ memberP(X0,X4) ) )
| ~ totalorderedP(X2)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f146,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f253,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f254,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f253]) ).
fof(f255,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK13(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK13(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK13(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f257,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1))
& ssList(sK13(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f254,f256,f255]) ).
fof(f322,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f146]) ).
fof(f323,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f322]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& totalorderedP(sK55)
& segmentP(X3,sK55)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& totalorderedP(sK55)
& segmentP(X3,sK55)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& totalorderedP(sK55)
& segmentP(sK56,sK55)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
=> ( ~ memberP(sK54,sK57)
& memberP(sK53,sK57)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ~ memberP(sK54,sK57)
& memberP(sK53,sK57)
& ssItem(sK57)
& totalorderedP(sK55)
& segmentP(sK56,sK55)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f222,f347,f346,f345,f344,f343]) ).
fof(f367,plain,
! [X0,X1] :
( ssList(sK13(X0,X1))
| ~ segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f257]) ).
fof(f368,plain,
! [X0,X1] :
( ssList(sK14(X0,X1))
| ~ segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f257]) ).
fof(f369,plain,
! [X0,X1] :
( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
| ~ segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f257]) ).
fof(f453,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f466,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f323]) ).
fof(f467,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f323]) ).
fof(f548,plain,
ssList(sK53),
inference(cnf_transformation,[],[f348]) ).
fof(f549,plain,
ssList(sK54),
inference(cnf_transformation,[],[f348]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f554,plain,
segmentP(sK56,sK55),
inference(cnf_transformation,[],[f348]) ).
fof(f556,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f557,plain,
memberP(sK53,sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
~ memberP(sK54,sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f559,plain,
~ memberP(sK56,sK57),
inference(definition_unfolding,[],[f558,f552]) ).
fof(f560,plain,
memberP(sK55,sK57),
inference(definition_unfolding,[],[f557,f553]) ).
fof(f561,plain,
ssList(sK56),
inference(definition_unfolding,[],[f549,f552]) ).
fof(f562,plain,
ssList(sK55),
inference(definition_unfolding,[],[f548,f553]) ).
cnf(c_68,plain,
( ~ segmentP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f369]) ).
cnf(c_69,plain,
( ~ segmentP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK14(X0,X1)) ),
inference(cnf_transformation,[],[f368]) ).
cnf(c_70,plain,
( ~ segmentP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK13(X0,X1)) ),
inference(cnf_transformation,[],[f367]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f453]) ).
cnf(c_165,plain,
( ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(app(X2,X0),X1) ),
inference(cnf_transformation,[],[f467]) ).
cnf(c_166,plain,
( ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(app(X0,X2),X1) ),
inference(cnf_transformation,[],[f466]) ).
cnf(c_246,negated_conjecture,
~ memberP(sK56,sK57),
inference(cnf_transformation,[],[f559]) ).
cnf(c_247,negated_conjecture,
memberP(sK55,sK57),
inference(cnf_transformation,[],[f560]) ).
cnf(c_248,negated_conjecture,
ssItem(sK57),
inference(cnf_transformation,[],[f556]) ).
cnf(c_250,negated_conjecture,
segmentP(sK56,sK55),
inference(cnf_transformation,[],[f554]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f561]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f562]) ).
cnf(c_20984,plain,
( ~ ssList(sK56)
| ~ ssList(sK55)
| app(app(sK13(sK56,sK55),sK55),sK14(sK56,sK55)) = sK56 ),
inference(superposition,[status(thm)],[c_250,c_68]) ).
cnf(c_20990,plain,
app(app(sK13(sK56,sK55),sK55),sK14(sK56,sK55)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_20984,c_254,c_253]) ).
cnf(c_21699,plain,
( ~ memberP(app(sK13(sK56,sK55),sK55),X0)
| ~ ssList(app(sK13(sK56,sK55),sK55))
| ~ ssList(sK14(sK56,sK55))
| ~ ssItem(X0)
| memberP(sK56,X0) ),
inference(superposition,[status(thm)],[c_20990,c_166]) ).
cnf(c_69997,plain,
( ~ ssList(app(sK13(sK56,sK55),sK55))
| ~ ssList(sK13(sK56,sK55))
| ~ ssList(sK14(sK56,sK55))
| ~ memberP(sK55,X0)
| ~ ssItem(X0)
| ~ ssList(sK55)
| memberP(sK56,X0) ),
inference(superposition,[status(thm)],[c_165,c_21699]) ).
cnf(c_70013,plain,
( ~ ssList(app(sK13(sK56,sK55),sK55))
| ~ ssList(sK13(sK56,sK55))
| ~ ssList(sK14(sK56,sK55))
| ~ memberP(sK55,X0)
| ~ ssItem(X0)
| memberP(sK56,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_69997,c_254]) ).
cnf(c_140416,plain,
( ~ ssList(sK13(sK56,sK55))
| ~ ssList(sK14(sK56,sK55))
| ~ memberP(sK55,X0)
| ~ ssItem(X0)
| ~ ssList(sK55)
| memberP(sK56,X0) ),
inference(superposition,[status(thm)],[c_153,c_70013]) ).
cnf(c_140417,plain,
( ~ ssList(sK13(sK56,sK55))
| ~ ssList(sK14(sK56,sK55))
| ~ memberP(sK55,X0)
| ~ ssItem(X0)
| memberP(sK56,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_140416,c_254]) ).
cnf(c_140439,plain,
( ~ ssList(sK13(sK56,sK55))
| ~ memberP(sK55,X0)
| ~ segmentP(sK56,sK55)
| ~ ssItem(X0)
| ~ ssList(sK56)
| ~ ssList(sK55)
| memberP(sK56,X0) ),
inference(superposition,[status(thm)],[c_69,c_140417]) ).
cnf(c_140440,plain,
( ~ ssList(sK13(sK56,sK55))
| ~ memberP(sK55,X0)
| ~ ssItem(X0)
| memberP(sK56,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_140439,c_254,c_253,c_250]) ).
cnf(c_140458,plain,
( ~ memberP(sK55,X0)
| ~ segmentP(sK56,sK55)
| ~ ssItem(X0)
| ~ ssList(sK56)
| ~ ssList(sK55)
| memberP(sK56,X0) ),
inference(superposition,[status(thm)],[c_70,c_140440]) ).
cnf(c_140459,plain,
( ~ memberP(sK55,X0)
| ~ ssItem(X0)
| memberP(sK56,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_140458,c_254,c_253,c_250]) ).
cnf(c_140483,plain,
( ~ ssItem(sK57)
| memberP(sK56,sK57) ),
inference(superposition,[status(thm)],[c_247,c_140459]) ).
cnf(c_140486,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_140483,c_246,c_248]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC400+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 17:04:35 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 47.74/7.23 % SZS status Started for theBenchmark.p
% 47.74/7.23 % SZS status Theorem for theBenchmark.p
% 47.74/7.23
% 47.74/7.23 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 47.74/7.23
% 47.74/7.23 ------ iProver source info
% 47.74/7.23
% 47.74/7.23 git: date: 2023-05-31 18:12:56 +0000
% 47.74/7.23 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 47.74/7.23 git: non_committed_changes: false
% 47.74/7.23 git: last_make_outside_of_git: false
% 47.74/7.23
% 47.74/7.23 ------ Parsing...
% 47.74/7.23 ------ Clausification by vclausify_rel & Parsing by iProver...
% 47.74/7.23
% 47.74/7.23 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 47.74/7.23
% 47.74/7.23 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 47.74/7.23
% 47.74/7.23 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 47.74/7.23 ------ Proving...
% 47.74/7.23 ------ Problem Properties
% 47.74/7.23
% 47.74/7.23
% 47.74/7.23 clauses 187
% 47.74/7.23 conjectures 7
% 47.74/7.23 EPR 56
% 47.74/7.23 Horn 119
% 47.74/7.23 unary 23
% 47.74/7.23 binary 40
% 47.74/7.23 lits 625
% 47.74/7.23 lits eq 78
% 47.74/7.23 fd_pure 0
% 47.74/7.23 fd_pseudo 0
% 47.74/7.23 fd_cond 21
% 47.74/7.23 fd_pseudo_cond 14
% 47.74/7.23 AC symbols 0
% 47.74/7.23
% 47.74/7.23 ------ Schedule dynamic 5 is on
% 47.74/7.23
% 47.74/7.23 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 47.74/7.23
% 47.74/7.23
% 47.74/7.23 ------
% 47.74/7.23 Current options:
% 47.74/7.23 ------
% 47.74/7.23
% 47.74/7.23
% 47.74/7.23
% 47.74/7.23
% 47.74/7.23 ------ Proving...
% 47.74/7.23
% 47.74/7.23
% 47.74/7.23 % SZS status Theorem for theBenchmark.p
% 47.74/7.23
% 47.74/7.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 47.74/7.23
% 47.74/7.24
%------------------------------------------------------------------------------