TSTP Solution File: SWC217+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC217+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:41:45 EDT 2023
% Result : Theorem 3.56s 1.15s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f596)
% 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/sandbox2/benchmark/theBenchmark.p',ax3) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ( nil = X3
& nil != X2 )
| neq(X0,nil)
| ~ neq(X1,nil)
| 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)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ( nil = X3
& nil != X2 )
| neq(X0,nil)
| ~ neq(X1,nil)
| 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(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& neq(X1,nil)
& 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] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK53,nil)
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK53,nil)
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ( nil != X3
| nil = sK55 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ( nil != X3
| nil = sK55 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ~ neq(sK56,nil)
| ? [X4] :
( memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ( nil != sK56
| nil = sK55 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) )
=> ( memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ( ~ neq(sK56,nil)
| ( memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) )
& ( nil != sK56
| nil = sK55 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& 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(f357,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(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(f471,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f534,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
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,
neq(sK54,nil),
inference(cnf_transformation,[],[f348]) ).
fof(f555,plain,
~ neq(sK53,nil),
inference(cnf_transformation,[],[f348]) ).
fof(f557,plain,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
( ~ neq(sK56,nil)
| sK55 = cons(sK57,nil) ),
inference(cnf_transformation,[],[f348]) ).
fof(f560,plain,
~ neq(sK55,nil),
inference(definition_unfolding,[],[f555,f553]) ).
fof(f561,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f554,f552]) ).
fof(f563,plain,
ssList(sK55),
inference(definition_unfolding,[],[f548,f553]) ).
fof(f565,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,[],[f357]) ).
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,[],[f565]) ).
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_171,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f471]) ).
cnf(c_229,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(cnf_transformation,[],[f596]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f534]) ).
cnf(c_247,negated_conjecture,
( ~ neq(sK56,nil)
| cons(sK57,nil) = sK55 ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_248,negated_conjecture,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_250,negated_conjecture,
~ neq(sK55,nil),
inference(cnf_transformation,[],[f560]) ).
cnf(c_251,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f561]) ).
cnf(c_255,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f563]) ).
cnf(c_296,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_362,negated_conjecture,
ssItem(sK57),
inference(global_subsumption_just,[status(thm)],[c_248,c_251,c_248]) ).
cnf(c_372,plain,
app(nil,nil) = nil,
inference(global_subsumption_just,[status(thm)],[c_229,c_141,c_296]) ).
cnf(c_374,negated_conjecture,
cons(sK57,nil) = sK55,
inference(global_subsumption_just,[status(thm)],[c_247,c_251,c_247]) ).
cnf(c_3219,plain,
( X0 != sK55
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_250]) ).
cnf(c_3220,plain,
( ~ ssList(nil)
| ~ ssList(sK55)
| sK55 = nil ),
inference(unflattening,[status(thm)],[c_3219]) ).
cnf(c_3221,plain,
sK55 = nil,
inference(global_subsumption_just,[status(thm)],[c_3220,c_255,c_141,c_3220]) ).
cnf(c_6111,plain,
cons(sK57,nil) = nil,
inference(light_normalisation,[status(thm)],[c_374,c_3221]) ).
cnf(c_15685,plain,
( ~ ssList(app(X0,cons(sK57,nil)))
| ~ ssList(X0)
| ~ ssItem(sK57)
| ~ ssList(nil)
| memberP(app(X0,nil),sK57) ),
inference(superposition,[status(thm)],[c_6111,c_54]) ).
cnf(c_15686,plain,
( ~ ssList(app(X0,nil))
| ~ ssList(X0)
| ~ ssItem(sK57)
| ~ ssList(nil)
| memberP(app(X0,nil),sK57) ),
inference(light_normalisation,[status(thm)],[c_15685,c_6111]) ).
cnf(c_15687,plain,
( ~ ssList(app(X0,nil))
| ~ ssList(X0)
| memberP(app(X0,nil),sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_15686,c_141,c_362]) ).
cnf(c_15730,plain,
( ~ ssList(app(nil,nil))
| ~ ssList(nil)
| memberP(nil,sK57) ),
inference(superposition,[status(thm)],[c_372,c_15687]) ).
cnf(c_15731,plain,
( ~ ssList(nil)
| memberP(nil,sK57) ),
inference(light_normalisation,[status(thm)],[c_15730,c_372]) ).
cnf(c_15732,plain,
memberP(nil,sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_15731,c_141]) ).
cnf(c_15828,plain,
~ ssItem(sK57),
inference(superposition,[status(thm)],[c_15732,c_171]) ).
cnf(c_15829,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_15828,c_362]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC217+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.19/0.35 % Computer : n010.cluster.edu
% 0.19/0.35 % Model : x86_64 x86_64
% 0.19/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.35 % Memory : 8042.1875MB
% 0.19/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.35 % CPULimit : 300
% 0.19/0.35 % WCLimit : 300
% 0.19/0.35 % DateTime : Mon Aug 28 14:56:04 EDT 2023
% 0.19/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.56/1.15 % SZS status Started for theBenchmark.p
% 3.56/1.15 % SZS status Theorem for theBenchmark.p
% 3.56/1.15
% 3.56/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.56/1.15
% 3.56/1.15 ------ iProver source info
% 3.56/1.15
% 3.56/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.56/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.56/1.15 git: non_committed_changes: false
% 3.56/1.15 git: last_make_outside_of_git: false
% 3.56/1.15
% 3.56/1.15 ------ Parsing...
% 3.56/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.56/1.15
% 3.56/1.15 ------ 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: 5 sf_s rm: 5 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e
% 3.56/1.15
% 3.56/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.56/1.15
% 3.56/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.56/1.15 ------ Proving...
% 3.56/1.15 ------ Problem Properties
% 3.56/1.15
% 3.56/1.15
% 3.56/1.15 clauses 186
% 3.56/1.15 conjectures 3
% 3.56/1.15 EPR 54
% 3.56/1.15 Horn 118
% 3.56/1.15 unary 22
% 3.56/1.15 binary 40
% 3.56/1.15 lits 624
% 3.56/1.15 lits eq 81
% 3.56/1.15 fd_pure 0
% 3.56/1.15 fd_pseudo 0
% 3.56/1.15 fd_cond 21
% 3.56/1.15 fd_pseudo_cond 14
% 3.56/1.15 AC symbols 0
% 3.56/1.15
% 3.56/1.15 ------ Schedule dynamic 5 is on
% 3.56/1.15
% 3.56/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.56/1.15
% 3.56/1.15
% 3.56/1.15 ------
% 3.56/1.15 Current options:
% 3.56/1.15 ------
% 3.56/1.15
% 3.56/1.15
% 3.56/1.15
% 3.56/1.15
% 3.56/1.15 ------ Proving...
% 3.56/1.15
% 3.56/1.15
% 3.56/1.15 % SZS status Theorem for theBenchmark.p
% 3.56/1.15
% 3.56/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.56/1.15
% 3.56/1.15
%------------------------------------------------------------------------------