TSTP Solution File: SWC381+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC381+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:12:15 EDT 2024
% Result : Theorem 3.83s 1.10s
% Output : CNFRefutation 3.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 8 unt; 0 def)
% Number of atoms : 259 ( 74 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 310 ( 96 ~; 85 |; 109 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 130 ( 16 sgn 60 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) )
| ? [X4] :
( memberP(X1,X4)
& cons(X4,nil) = X0
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| 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)
| ~ neq(X1,nil) )
& ( ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) )
| ? [X4] :
( memberP(X1,X4)
& cons(X4,nil) = X0
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| 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)
| ~ neq(X1,nil) )
& ( ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) )
| ? [X5] :
( memberP(X1,X5)
& cons(X5,nil) = X0
& ssItem(X5) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& 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)
& neq(X1,nil) )
| ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f233,plain,
! [X3,X2,X1,X0] :
( ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& neq(X1,nil) )
| ~ sP6(X3,X2,X1,X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f234,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X3,X2,X1,X0) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f223,f233]) ).
fof(f346,plain,
! [X3,X2,X1,X0] :
( ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& neq(X1,nil) )
| ~ sP6(X3,X2,X1,X0) ),
inference(nnf_transformation,[],[f233]) ).
fof(f347,plain,
! [X0,X1,X2,X3] :
( ( ? [X4] :
( memberP(X0,X4)
& cons(X4,nil) = X1
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X2,X5)
| cons(X5,nil) != X3
| ~ ssItem(X5) )
& neq(X2,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(rectify,[],[f346]) ).
fof(f348,plain,
! [X0,X1] :
( ? [X4] :
( memberP(X0,X4)
& cons(X4,nil) = X1
& ssItem(X4) )
=> ( memberP(X0,sK54(X0,X1))
& cons(sK54(X0,X1),nil) = X1
& ssItem(sK54(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
! [X0,X1,X2,X3] :
( ( memberP(X0,sK54(X0,X1))
& cons(sK54(X0,X1),nil) = X1
& ssItem(sK54(X0,X1))
& ! [X5] :
( ~ memberP(X2,X5)
| cons(X5,nil) != X3
| ~ ssItem(X5) )
& neq(X2,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK54])],[f347,f348]) ).
fof(f350,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X3,X2,X1,X0) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X3,X2,X1,sK55) )
& sK55 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f351,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X3,X2,X1,sK55) )
& sK55 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK56,nil) )
| sP6(X3,X2,sK56,sK55) )
& sK55 = X2
& sK56 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f352,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK56,nil) )
| sP6(X3,X2,sK56,sK55) )
& sK55 = X2
& sK56 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK56,nil) )
| sP6(X3,sK57,sK56,sK55) )
& sK55 = sK57
& sK56 = X3
& ssList(X3) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f353,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK56,nil) )
| sP6(X3,sK57,sK56,sK55) )
& sK55 = sK57
& sK56 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK58,nil)
& neq(sK56,nil) )
| sP6(sK58,sK57,sK56,sK55) )
& sK55 = sK57
& sK56 = sK58
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f354,plain,
( ( ( ~ neq(sK58,nil)
& neq(sK56,nil) )
| sP6(sK58,sK57,sK56,sK55) )
& sK55 = sK57
& sK56 = sK58
& ssList(sK58)
& ssList(sK57)
& ssList(sK56)
& ssList(sK55) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK55,sK56,sK57,sK58])],[f234,f353,f352,f351,f350]) ).
fof(f555,plain,
! [X2,X3,X0,X1,X5] :
( ~ memberP(X2,X5)
| cons(X5,nil) != X3
| ~ ssItem(X5)
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
! [X2,X3,X0,X1] :
( ssItem(sK54(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f557,plain,
! [X2,X3,X0,X1] :
( cons(sK54(X0,X1),nil) = X1
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f558,plain,
! [X2,X3,X0,X1] :
( memberP(X0,sK54(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f563,plain,
sK56 = sK58,
inference(cnf_transformation,[],[f354]) ).
fof(f564,plain,
sK55 = sK57,
inference(cnf_transformation,[],[f354]) ).
fof(f565,plain,
( neq(sK56,nil)
| sP6(sK58,sK57,sK56,sK55) ),
inference(cnf_transformation,[],[f354]) ).
fof(f566,plain,
( ~ neq(sK58,nil)
| sP6(sK58,sK57,sK56,sK55) ),
inference(cnf_transformation,[],[f354]) ).
fof(f567,plain,
( ~ neq(sK58,nil)
| sP6(sK58,sK57,sK58,sK57) ),
inference(definition_unfolding,[],[f566,f563,f564]) ).
fof(f568,plain,
( neq(sK58,nil)
| sP6(sK58,sK57,sK58,sK57) ),
inference(definition_unfolding,[],[f565,f563,f563,f564]) ).
fof(f598,plain,
! [X2,X0,X1,X5] :
( ~ memberP(X2,X5)
| ~ ssItem(X5)
| ~ sP6(X0,X1,X2,cons(X5,nil)) ),
inference(equality_resolution,[],[f555]) ).
cnf(c_246,plain,
( ~ sP6(X0,X1,X2,X3)
| memberP(X0,sK54(X0,X1)) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_247,plain,
( ~ sP6(X0,X1,X2,X3)
| cons(sK54(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_248,plain,
( ~ sP6(X0,X1,X2,X3)
| ssItem(sK54(X0,X1)) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_249,plain,
( ~ sP6(X0,X1,X2,cons(X3,nil))
| ~ memberP(X2,X3)
| ~ ssItem(X3) ),
inference(cnf_transformation,[],[f598]) ).
cnf(c_251,negated_conjecture,
( ~ neq(sK58,nil)
| sP6(sK58,sK57,sK58,sK57) ),
inference(cnf_transformation,[],[f567]) ).
cnf(c_252,negated_conjecture,
( sP6(sK58,sK57,sK58,sK57)
| neq(sK58,nil) ),
inference(cnf_transformation,[],[f568]) ).
cnf(c_373,negated_conjecture,
sP6(sK58,sK57,sK58,sK57),
inference(global_subsumption_just,[status(thm)],[c_252,c_252,c_251]) ).
cnf(c_375,negated_conjecture,
sP6(sK58,sK57,sK58,sK57),
inference(global_subsumption_just,[status(thm)],[c_251,c_373]) ).
cnf(c_3129,plain,
( X0 != sK58
| X1 != sK57
| X2 != sK58
| X3 != sK57
| ssItem(sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_248,c_375]) ).
cnf(c_3130,plain,
ssItem(sK54(sK58,sK57)),
inference(unflattening,[status(thm)],[c_3129]) ).
cnf(c_3134,plain,
( X0 != sK58
| X1 != sK57
| X2 != sK58
| X3 != sK57
| cons(sK54(X0,X1),nil) = X1 ),
inference(resolution_lifted,[status(thm)],[c_247,c_375]) ).
cnf(c_3135,plain,
cons(sK54(sK58,sK57),nil) = sK57,
inference(unflattening,[status(thm)],[c_3134]) ).
cnf(c_3139,plain,
( X0 != sK58
| X1 != sK57
| X2 != sK58
| X3 != sK57
| memberP(X0,sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_246,c_375]) ).
cnf(c_3140,plain,
memberP(sK58,sK54(sK58,sK57)),
inference(unflattening,[status(thm)],[c_3139]) ).
cnf(c_3144,plain,
( cons(X0,nil) != sK57
| X1 != sK58
| X2 != sK57
| X3 != sK58
| ~ memberP(X3,X0)
| ~ ssItem(X0) ),
inference(resolution_lifted,[status(thm)],[c_249,c_375]) ).
cnf(c_3145,plain,
( cons(X0,nil) != sK57
| ~ memberP(sK58,X0)
| ~ ssItem(X0) ),
inference(unflattening,[status(thm)],[c_3144]) ).
cnf(c_11726,plain,
( ~ memberP(sK58,sK54(sK58,sK57))
| ~ ssItem(sK54(sK58,sK57)) ),
inference(superposition,[status(thm)],[c_3135,c_3145]) ).
cnf(c_11727,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11726,c_3130,c_3140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SWC381+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 23:19:41 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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
% 3.83/1.10 % SZS status Started for theBenchmark.p
% 3.83/1.10 % SZS status Theorem for theBenchmark.p
% 3.83/1.10
% 3.83/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.83/1.10
% 3.83/1.10 ------ iProver source info
% 3.83/1.10
% 3.83/1.10 git: date: 2024-05-02 19:28:25 +0000
% 3.83/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.83/1.10 git: non_committed_changes: false
% 3.83/1.10
% 3.83/1.10 ------ Parsing...
% 3.83/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.83/1.10
% 3.83/1.10 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe_e
% 3.83/1.10
% 3.83/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.83/1.10
% 3.83/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.83/1.10 ------ Proving...
% 3.83/1.10 ------ Problem Properties
% 3.83/1.10
% 3.83/1.10
% 3.83/1.10 clauses 187
% 3.83/1.10 conjectures 2
% 3.83/1.10 EPR 52
% 3.83/1.10 Horn 119
% 3.83/1.10 unary 22
% 3.83/1.10 binary 40
% 3.83/1.10 lits 627
% 3.83/1.10 lits eq 81
% 3.83/1.10 fd_pure 0
% 3.83/1.10 fd_pseudo 0
% 3.83/1.10 fd_cond 21
% 3.83/1.10 fd_pseudo_cond 14
% 3.83/1.10 AC symbols 0
% 3.83/1.10
% 3.83/1.10 ------ Schedule dynamic 5 is on
% 3.83/1.10
% 3.83/1.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.83/1.10
% 3.83/1.10
% 3.83/1.10 ------
% 3.83/1.10 Current options:
% 3.83/1.10 ------
% 3.83/1.10
% 3.83/1.10
% 3.83/1.10
% 3.83/1.10
% 3.83/1.10 ------ Proving...
% 3.83/1.10
% 3.83/1.10
% 3.83/1.10 % SZS status Theorem for theBenchmark.p
% 3.83/1.10
% 3.83/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.83/1.10
% 3.83/1.11
%------------------------------------------------------------------------------