TSTP Solution File: SWC101+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC101+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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 : Fri May 3 03:11:13 EDT 2024
% Result : Theorem 0.50s 1.16s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ( nil = X0
& nil = X1 )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ( nil = X0
& nil = X1 )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X0
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X0
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f245,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f101]) ).
fof(f246,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f245]) ).
fof(f247,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f248,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f246,f247]) ).
fof(f316,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X0
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,sK53)
| ~ neq(sK53,nil) )
& ( nil != sK53
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,sK53)
| ~ neq(sK53,nil) )
& ( nil != sK53
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& ( nil != sK53
| nil != sK54 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& ( nil != sK53
| nil != sK54 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& ( nil != sK53
| nil != sK54 )
& ( nil != sK55
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK55
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK55)
& app(sK55,X4) = X3
& ssList(X4) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& ( nil != sK53
| nil != sK54 )
& ( nil != sK55
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK55
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK55)
& app(sK55,X4) = X3
& ssList(X4) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& ( nil != sK53
| nil != sK54 )
& ( nil != sK55
| nil = sK56 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK55
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK55)
& app(sK55,X4) = sK56
& ssList(X4) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK55
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK55)
& app(sK55,X4) = sK56
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK55
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != sK57
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK55)
& sK56 = app(sK55,sK57)
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& ( nil != sK53
| nil != sK54 )
& ( nil != sK55
| nil = sK56 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK55
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != sK57
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK55)
& sK56 = app(sK55,sK57)
& ssList(sK57)
& 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(f363,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f439,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f316]) ).
fof(f441,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f453,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f548,plain,
ssList(sK53),
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,
ssList(sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f555,plain,
sK56 = app(sK55,sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
( nil != sK55
| nil = sK56 ),
inference(cnf_transformation,[],[f348]) ).
fof(f559,plain,
( nil != sK53
| nil != sK54 ),
inference(cnf_transformation,[],[f348]) ).
fof(f560,plain,
( ~ frontsegP(sK54,sK53)
| ~ neq(sK53,nil) ),
inference(cnf_transformation,[],[f348]) ).
fof(f561,plain,
( ~ frontsegP(sK56,sK55)
| ~ neq(sK55,nil) ),
inference(definition_unfolding,[],[f560,f552,f553,f553]) ).
fof(f562,plain,
( nil != sK55
| nil != sK56 ),
inference(definition_unfolding,[],[f559,f553,f552]) ).
fof(f564,plain,
ssList(sK55),
inference(definition_unfolding,[],[f548,f553]) ).
fof(f568,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f363]) ).
cnf(c_61,plain,
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X0,X1),X0) ),
inference(cnf_transformation,[],[f568]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f439]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f441]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f453]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK55,nil)
| ~ frontsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_247,negated_conjecture,
( nil != sK56
| nil != sK55 ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_248,negated_conjecture,
( nil != sK55
| nil = sK56 ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_251,negated_conjecture,
app(sK55,sK57) = sK56,
inference(cnf_transformation,[],[f555]) ).
cnf(c_252,negated_conjecture,
ssList(sK57),
inference(cnf_transformation,[],[f554]) ).
cnf(c_256,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f564]) ).
cnf(c_370,negated_conjecture,
nil != sK55,
inference(global_subsumption_just,[status(thm)],[c_248,c_248,c_247]) ).
cnf(c_374,negated_conjecture,
nil != sK55,
inference(global_subsumption_just,[status(thm)],[c_247,c_370]) ).
cnf(c_383,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X0,X1),X0) ),
inference(global_subsumption_just,[status(thm)],[c_61,c_153,c_61]) ).
cnf(c_3237,plain,
( X0 != sK55
| X1 != nil
| ~ frontsegP(sK56,sK55)
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_246]) ).
cnf(c_3238,plain,
( ~ frontsegP(sK56,sK55)
| ~ ssList(nil)
| ~ ssList(sK55)
| sK55 = nil ),
inference(unflattening,[status(thm)],[c_3237]) ).
cnf(c_3239,plain,
( ~ frontsegP(sK56,sK55)
| sK55 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3238,c_256,c_141,c_3238]) ).
cnf(c_8923,plain,
app(sK55,sK57) = sP0_iProver_def,
definition ).
cnf(c_8924,negated_conjecture,
nil != sK55,
inference(demodulation,[status(thm)],[c_374]) ).
cnf(c_8925,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_256]) ).
cnf(c_8927,negated_conjecture,
ssList(sK57),
inference(demodulation,[status(thm)],[c_252]) ).
cnf(c_8928,negated_conjecture,
sP0_iProver_def = sK56,
inference(demodulation,[status(thm)],[c_251,c_8923]) ).
cnf(c_11764,plain,
( ~ frontsegP(sP0_iProver_def,sK55)
| nil = sK55 ),
inference(light_normalisation,[status(thm)],[c_3239,c_8928]) ).
cnf(c_11765,plain,
~ frontsegP(sP0_iProver_def,sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_11764,c_8924]) ).
cnf(c_11841,plain,
( ~ ssList(sK55)
| ~ ssList(sK57)
| frontsegP(sP0_iProver_def,sK55) ),
inference(superposition,[status(thm)],[c_8923,c_383]) ).
cnf(c_11842,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11841,c_11765,c_8927,c_8925]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC101+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 23:35:03 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.50/1.16 % SZS status Started for theBenchmark.p
% 0.50/1.16 % SZS status Theorem for theBenchmark.p
% 0.50/1.16
% 0.50/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.50/1.16
% 0.50/1.16 ------ iProver source info
% 0.50/1.16
% 0.50/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.50/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.50/1.16 git: non_committed_changes: false
% 0.50/1.16
% 0.50/1.16 ------ Parsing...
% 0.50/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.50/1.16
% 0.50/1.16 ------ 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: 5 0s sf_e pe_s pe_e
% 0.50/1.16
% 0.50/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.50/1.16
% 0.50/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.50/1.16 ------ Proving...
% 0.50/1.16 ------ Problem Properties
% 0.50/1.16
% 0.50/1.16
% 0.50/1.16 clauses 189
% 0.50/1.16 conjectures 7
% 0.50/1.16 EPR 56
% 0.50/1.16 Horn 121
% 0.50/1.16 unary 23
% 0.50/1.16 binary 41
% 0.50/1.16 lits 632
% 0.50/1.16 lits eq 84
% 0.50/1.16 fd_pure 0
% 0.50/1.16 fd_pseudo 0
% 0.50/1.16 fd_cond 21
% 0.50/1.16 fd_pseudo_cond 14
% 0.50/1.16 AC symbols 0
% 0.50/1.16
% 0.50/1.16 ------ Schedule dynamic 5 is on
% 0.50/1.16
% 0.50/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.50/1.16
% 0.50/1.16
% 0.50/1.16 ------
% 0.50/1.16 Current options:
% 0.50/1.16 ------
% 0.50/1.16
% 0.50/1.16
% 0.50/1.16
% 0.50/1.16
% 0.50/1.16 ------ Proving...
% 0.50/1.16
% 0.50/1.16
% 0.50/1.16 % SZS status Theorem for theBenchmark.p
% 0.50/1.16
% 0.50/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.50/1.16
% 0.50/1.17
%------------------------------------------------------------------------------