TSTP Solution File: SWC387+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC387+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:03 EDT 2023
% Result : Theorem 0.44s 1.12s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 55 ( 13 unt; 0 def)
% Number of atoms : 341 ( 160 equ)
% Maximal formula atoms : 34 ( 6 avg)
% Number of connectives : 441 ( 155 ~; 133 |; 129 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 83 ( 0 sgn; 36 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
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(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( memberP(X1,X4)
& cons(X4,nil) = X0
& ssItem(X4) )
| 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)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( memberP(X1,X4)
& cons(X4,nil) = X0
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [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 = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X5] :
( memberP(X1,X5)
& cons(X5,nil) = X0
& ssItem(X5) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f317,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& 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 != sK53
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != sK53
| ~ ssItem(X5) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK53
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != sK53
| ~ ssItem(X5) )
& 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 != sK53
| nil != sK54 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(sK54,X5)
| cons(X5,nil) != sK53
| ~ ssItem(X5) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(sK54,X5)
| cons(X5,nil) != sK53
| ~ ssItem(X5) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ( nil != X3
| nil = sK55 )
& ! [X5] :
( ~ memberP(sK54,X5)
| cons(X5,nil) != sK53
| ~ ssItem(X5) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ( nil != X3
| nil = sK55 )
& ! [X5] :
( ~ memberP(sK54,X5)
| cons(X5,nil) != sK53
| ~ ssItem(X5) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ~ neq(sK56,nil)
| ? [X4] :
( memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ( nil != sK56
| nil = sK55 )
& ! [X5] :
( ~ memberP(sK54,X5)
| cons(X5,nil) != sK53
| ~ ssItem(X5) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) )
=> ( memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ( ~ neq(sK56,nil)
| ( memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) )
& ( nil != sK53
| nil != sK54 )
& ( nil != sK56
| nil = sK55 )
& ! [X5] :
( ~ memberP(sK54,X5)
| cons(X5,nil) != sK53
| ~ ssItem(X5) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f223,f348,f347,f346,f345,f344]) ).
fof(f440,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f317]) ).
fof(f442,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
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,
! [X5] :
( ~ memberP(sK54,X5)
| cons(X5,nil) != sK53
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f349]) ).
fof(f557,plain,
( nil != sK53
| nil != sK54 ),
inference(cnf_transformation,[],[f349]) ).
fof(f558,plain,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f559,plain,
( ~ neq(sK56,nil)
| sK55 = cons(sK57,nil) ),
inference(cnf_transformation,[],[f349]) ).
fof(f560,plain,
( ~ neq(sK56,nil)
| memberP(sK56,sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f561,plain,
( nil != sK55
| nil != sK56 ),
inference(definition_unfolding,[],[f557,f554,f553]) ).
fof(f562,plain,
! [X5] :
( ~ memberP(sK56,X5)
| cons(X5,nil) != sK55
| ~ ssItem(X5) ),
inference(definition_unfolding,[],[f555,f553,f554]) ).
fof(f563,plain,
ssList(sK56),
inference(definition_unfolding,[],[f550,f553]) ).
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_246,negated_conjecture,
( ~ neq(sK56,nil)
| memberP(sK56,sK57) ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_247,negated_conjecture,
( ~ neq(sK56,nil)
| cons(sK57,nil) = sK55 ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_248,negated_conjecture,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_249,negated_conjecture,
( nil != sK56
| nil != sK55 ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_250,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_251,negated_conjecture,
( cons(X0,nil) != sK55
| ~ memberP(sK56,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_254,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f563]) ).
cnf(c_369,negated_conjecture,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_250,c_250,c_249]) ).
cnf(c_373,negated_conjecture,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_249,c_369]) ).
cnf(c_3238,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| ssItem(sK57) ),
inference(resolution_lifted,[status(thm)],[c_138,c_248]) ).
cnf(c_3239,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = nil
| ssItem(sK57) ),
inference(unflattening,[status(thm)],[c_3238]) ).
cnf(c_3240,plain,
( sK56 = nil
| ssItem(sK57) ),
inference(global_subsumption_just,[status(thm)],[c_3239,c_254,c_141,c_3239]) ).
cnf(c_3248,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| cons(sK57,nil) = sK55
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_247]) ).
cnf(c_3249,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| cons(sK57,nil) = sK55
| sK56 = nil ),
inference(unflattening,[status(thm)],[c_3248]) ).
cnf(c_3250,plain,
( cons(sK57,nil) = sK55
| sK56 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3249,c_254,c_141,c_3249]) ).
cnf(c_3258,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| memberP(sK56,sK57) ),
inference(resolution_lifted,[status(thm)],[c_138,c_246]) ).
cnf(c_3259,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = nil
| memberP(sK56,sK57) ),
inference(unflattening,[status(thm)],[c_3258]) ).
cnf(c_3260,plain,
( sK56 = nil
| memberP(sK56,sK57) ),
inference(global_subsumption_just,[status(thm)],[c_3259,c_254,c_141,c_3259]) ).
cnf(c_11731,plain,
( ~ memberP(sK56,sK57)
| ~ ssItem(sK57)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_3250,c_251]) ).
cnf(c_11732,plain,
( ~ memberP(sK56,sK57)
| ~ ssItem(sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11731,c_373]) ).
cnf(c_11739,plain,
( ~ ssItem(sK57)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_3260,c_11732]) ).
cnf(c_11740,plain,
~ ssItem(sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_11739,c_373]) ).
cnf(c_11741,plain,
nil = sK56,
inference(backward_subsumption_resolution,[status(thm)],[c_3240,c_11740]) ).
cnf(c_11742,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11741,c_373]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC387+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n003.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Aug 28 17:00:55 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.44/1.12 % SZS status Started for theBenchmark.p
% 0.44/1.12 % SZS status Theorem for theBenchmark.p
% 0.44/1.12
% 0.44/1.12 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.44/1.12
% 0.44/1.12 ------ iProver source info
% 0.44/1.12
% 0.44/1.12 git: date: 2023-05-31 18:12:56 +0000
% 0.44/1.12 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.44/1.12 git: non_committed_changes: false
% 0.44/1.12 git: last_make_outside_of_git: false
% 0.44/1.12
% 0.44/1.12 ------ Parsing...
% 0.44/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.44/1.12
% 0.44/1.12 ------ 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.44/1.12
% 0.44/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.44/1.12
% 0.44/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.44/1.12 ------ Proving...
% 0.44/1.12 ------ Problem Properties
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12 clauses 187
% 0.44/1.12 conjectures 4
% 0.44/1.12 EPR 54
% 0.44/1.12 Horn 116
% 0.44/1.12 unary 19
% 0.44/1.12 binary 43
% 0.44/1.12 lits 630
% 0.44/1.12 lits eq 84
% 0.44/1.12 fd_pure 0
% 0.44/1.12 fd_pseudo 0
% 0.44/1.12 fd_cond 21
% 0.44/1.12 fd_pseudo_cond 14
% 0.44/1.12 AC symbols 0
% 0.44/1.12
% 0.44/1.12 ------ Schedule dynamic 5 is on
% 0.44/1.12
% 0.44/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12 ------
% 0.44/1.12 Current options:
% 0.44/1.12 ------
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12 ------ Proving...
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12 % SZS status Theorem for theBenchmark.p
% 0.44/1.12
% 0.44/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.12
% 0.44/1.13
%------------------------------------------------------------------------------