TSTP Solution File: SWC029+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC029+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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:40:27 EDT 2023
% Result : Theorem 0.44s 1.14s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 13
% Syntax : Number of formulae : 74 ( 14 unt; 0 def)
% Number of atoms : 423 ( 203 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 510 ( 161 ~; 153 |; 167 &)
% ( 4 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 122 ( 0 sgn; 50 !; 60 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ( memberP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(X2,cons(X1,X3)) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
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(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X2
| app(cons(X4,nil),X5) != X3 ) ) ) )
| ( nil = X3
& nil != X2 )
| 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)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X2
| app(cons(X4,nil),X5) != X3 ) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f99,plain,
! [X0] :
( ! [X1] :
( ( memberP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(X2,cons(X1,X3)) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f148,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f236,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(X2,cons(X1,X3)) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(X2,cons(X1,X3)) = X0
& ssList(X3) )
& ssList(X2) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f99]) ).
fof(f237,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(X2,cons(X1,X3)) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(X4,cons(X1,X5)) = X0
& ssList(X5) )
& ssList(X4) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f236]) ).
fof(f238,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(X4,cons(X1,X5)) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(sK8(X0,X1),cons(X1,X5)) = X0
& ssList(X5) )
& ssList(sK8(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f239,plain,
! [X0,X1] :
( ? [X5] :
( app(sK8(X0,X1),cons(X1,X5)) = X0
& ssList(X5) )
=> ( app(sK8(X0,X1),cons(X1,sK9(X0,X1))) = X0
& ssList(sK9(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f240,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(X2,cons(X1,X3)) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(sK8(X0,X1),cons(X1,sK9(X0,X1))) = X0
& ssList(sK9(X0,X1))
& ssList(sK8(X0,X1)) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9])],[f237,f239,f238]) ).
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] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK53 )
| ( nil != sK53
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK53 )
| ( nil != sK53
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK55
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK55 )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK55
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK55 )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(sK56,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK55
& app(cons(X4,nil),X5) = sK56
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != sK56
| nil = sK55 )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK55
& app(cons(X4,nil),X5) = sK56
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( sK55 = app(X5,cons(sK57,nil))
& sK56 = app(cons(sK57,nil),X5)
& ssList(X5) )
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X5] :
( sK55 = app(X5,cons(sK57,nil))
& sK56 = app(cons(sK57,nil),X5)
& ssList(X5) )
=> ( sK55 = app(sK58,cons(sK57,nil))
& sK56 = app(cons(sK57,nil),sK58)
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(sK56,nil)
| ( sK55 = app(sK58,cons(sK57,nil))
& sK56 = app(cons(sK57,nil),sK58)
& ssList(sK58)
& ssItem(sK57) ) )
& ( nil != sK56
| nil = 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,sK58])],[f222,f348,f347,f346,f345,f344,f343]) ).
fof(f358,plain,
! [X2,X3,X0,X1] :
( memberP(X0,X1)
| app(X2,cons(X1,X3)) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f240]) ).
fof(f440,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f316]) ).
fof(f442,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f472,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f550,plain,
ssList(sK54),
inference(cnf_transformation,[],[f349]) ).
fof(f553,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f349]) ).
fof(f554,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f349]) ).
fof(f555,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f557,plain,
( ~ neq(sK56,nil)
| ssList(sK58) ),
inference(cnf_transformation,[],[f349]) ).
fof(f559,plain,
( ~ neq(sK56,nil)
| sK55 = app(sK58,cons(sK57,nil)) ),
inference(cnf_transformation,[],[f349]) ).
fof(f560,plain,
( nil = sK53
| nil = sK54 ),
inference(cnf_transformation,[],[f349]) ).
fof(f563,plain,
( nil != sK54
| nil != sK53 ),
inference(cnf_transformation,[],[f349]) ).
fof(f564,plain,
( nil != sK56
| nil != sK55 ),
inference(definition_unfolding,[],[f563,f553,f554]) ).
fof(f567,plain,
( nil = sK55
| nil = sK56 ),
inference(definition_unfolding,[],[f560,f554,f553]) ).
fof(f568,plain,
ssList(sK56),
inference(definition_unfolding,[],[f550,f553]) ).
fof(f571,plain,
! [X2,X3,X1] :
( memberP(app(X2,cons(X1,X3)),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssList(app(X2,cons(X1,X3))) ),
inference(equality_resolution,[],[f358]) ).
cnf(c_54,plain,
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(app(X0,cons(X1,X2)),X1) ),
inference(cnf_transformation,[],[f571]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f440]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f442]) ).
cnf(c_171,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f472]) ).
cnf(c_246,negated_conjecture,
( nil != sK56
| nil != sK55 ),
inference(cnf_transformation,[],[f564]) ).
cnf(c_247,negated_conjecture,
( nil = sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f567]) ).
cnf(c_248,negated_conjecture,
( ~ neq(sK56,nil)
| app(sK58,cons(sK57,nil)) = sK55 ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_250,negated_conjecture,
( ~ neq(sK56,nil)
| ssList(sK58) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_251,negated_conjecture,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_252,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_255,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f568]) ).
cnf(c_369,negated_conjecture,
nil = sK55,
inference(global_subsumption_just,[status(thm)],[c_247,c_247,c_252]) ).
cnf(c_371,negated_conjecture,
nil = sK55,
inference(global_subsumption_just,[status(thm)],[c_252,c_369]) ).
cnf(c_375,negated_conjecture,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_246,c_247,c_252,c_246]) ).
cnf(c_2162,plain,
( ~ neq(sK56,nil)
| app(sK58,cons(sK57,nil)) = nil ),
inference(light_normalisation,[status(thm)],[c_248,c_371]) ).
cnf(c_3240,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| app(sK58,cons(sK57,nil)) = nil
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_2162]) ).
cnf(c_3241,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| app(sK58,cons(sK57,nil)) = nil
| sK56 = nil ),
inference(unflattening,[status(thm)],[c_3240]) ).
cnf(c_3242,plain,
( app(sK58,cons(sK57,nil)) = nil
| sK56 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3241,c_255,c_141,c_3241]) ).
cnf(c_3250,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| ssItem(sK57) ),
inference(resolution_lifted,[status(thm)],[c_138,c_251]) ).
cnf(c_3251,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = nil
| ssItem(sK57) ),
inference(unflattening,[status(thm)],[c_3250]) ).
cnf(c_3252,plain,
( sK56 = nil
| ssItem(sK57) ),
inference(global_subsumption_just,[status(thm)],[c_3251,c_255,c_141,c_3251]) ).
cnf(c_3260,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| ssList(sK58) ),
inference(resolution_lifted,[status(thm)],[c_138,c_250]) ).
cnf(c_3261,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = nil
| ssList(sK58) ),
inference(unflattening,[status(thm)],[c_3260]) ).
cnf(c_3262,plain,
( sK56 = nil
| ssList(sK58) ),
inference(global_subsumption_just,[status(thm)],[c_3261,c_255,c_141,c_3261]) ).
cnf(c_11752,plain,
( ~ ssList(app(sK58,cons(sK57,nil)))
| ~ ssItem(sK57)
| ~ ssList(nil)
| ~ ssList(sK58)
| nil = sK56
| memberP(nil,sK57) ),
inference(superposition,[status(thm)],[c_3242,c_54]) ).
cnf(c_11753,plain,
( ~ ssList(app(sK58,cons(sK57,nil)))
| ~ ssItem(sK57)
| ~ ssList(sK58)
| memberP(nil,sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11752,c_375,c_141]) ).
cnf(c_11798,plain,
( ~ ssItem(sK57)
| ~ ssList(nil)
| ~ ssList(sK58)
| nil = sK56
| memberP(nil,sK57) ),
inference(superposition,[status(thm)],[c_3242,c_11753]) ).
cnf(c_11799,plain,
( ~ ssItem(sK57)
| ~ ssList(sK58)
| memberP(nil,sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11798,c_375,c_141]) ).
cnf(c_11930,plain,
( ~ ssItem(sK57)
| ~ ssList(sK58) ),
inference(backward_subsumption_resolution,[status(thm)],[c_11799,c_171]) ).
cnf(c_11940,plain,
( ~ ssList(sK58)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_3252,c_11930]) ).
cnf(c_11941,plain,
~ ssList(sK58),
inference(forward_subsumption_resolution,[status(thm)],[c_11940,c_375]) ).
cnf(c_11942,plain,
nil = sK56,
inference(backward_subsumption_resolution,[status(thm)],[c_3262,c_11941]) ).
cnf(c_11943,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11942,c_375]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC029+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n007.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 Aug 28 18:34:43 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.44/1.14 % SZS status Started for theBenchmark.p
% 0.44/1.14 % SZS status Theorem for theBenchmark.p
% 0.44/1.14
% 0.44/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.44/1.14
% 0.44/1.14 ------ iProver source info
% 0.44/1.14
% 0.44/1.14 git: date: 2023-05-31 18:12:56 +0000
% 0.44/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.44/1.14 git: non_committed_changes: false
% 0.44/1.14 git: last_make_outside_of_git: false
% 0.44/1.14
% 0.44/1.14 ------ Parsing...
% 0.44/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.44/1.14
% 0.44/1.14 ------ Preprocessing... sup_sim: 3 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.44/1.14
% 0.44/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.44/1.14
% 0.44/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.44/1.14 ------ Proving...
% 0.44/1.14 ------ Problem Properties
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 clauses 187
% 0.44/1.14 conjectures 3
% 0.44/1.14 EPR 54
% 0.44/1.14 Horn 115
% 0.44/1.14 unary 19
% 0.44/1.14 binary 44
% 0.44/1.14 lits 629
% 0.44/1.14 lits eq 86
% 0.44/1.14 fd_pure 0
% 0.44/1.14 fd_pseudo 0
% 0.44/1.14 fd_cond 21
% 0.44/1.14 fd_pseudo_cond 14
% 0.44/1.14 AC symbols 0
% 0.44/1.14
% 0.44/1.14 ------ Schedule dynamic 5 is on
% 0.44/1.14
% 0.44/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 ------
% 0.44/1.14 Current options:
% 0.44/1.14 ------
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 ------ Proving...
% 0.44/1.14
% 0.44/1.14
% 0.44/1.14 % SZS status Theorem for theBenchmark.p
% 0.44/1.14
% 0.44/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.14
% 0.44/1.14
%------------------------------------------------------------------------------