TSTP Solution File: SWC320+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC320+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:42:31 EDT 2023
% Result : Theorem 0.47s 1.17s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 8 unt; 0 def)
% Number of atoms : 351 ( 183 equ)
% Maximal formula atoms : 40 ( 7 avg)
% Number of connectives : 463 ( 158 ~; 141 |; 146 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 106 ( 0 sgn; 46 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) = X0
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) = X0
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X1
& app(cons(X4,nil),X5) = X0
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) != X2
| ~ ssList(X7) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X1
| app(cons(X4,nil),X5) != X0
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X1
| app(cons(X4,nil),X5) != X0
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X1
| app(cons(X4,nil),X5) != sK53
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != sK53
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ( 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] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X1
| app(cons(X4,nil),X5) != sK53
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != sK53
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK54
| app(cons(X4,nil),X5) != sK53
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK54
| app(cons(X4,nil),X5) != sK53
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK54
| app(cons(X4,nil),X5) != sK53
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = sK55
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = sK55 )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK54
| app(cons(X4,nil),X5) != sK53
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = sK55
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = sK55 )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK54
| app(cons(X4,nil),X5) != sK53
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(sK56,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = sK56
& app(cons(X6,nil),X7) = sK55
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != sK56
| nil = sK55 )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = sK56
& app(cons(X6,nil),X7) = sK55
& ssList(X7) )
& ssItem(X6) )
=> ( ? [X7] :
( sK56 = app(X7,cons(sK57,nil))
& sK55 = app(cons(sK57,nil),X7)
& ssList(X7) )
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X7] :
( sK56 = app(X7,cons(sK57,nil))
& sK55 = app(cons(sK57,nil),X7)
& ssList(X7) )
=> ( sK56 = app(sK58,cons(sK57,nil))
& sK55 = app(cons(sK57,nil),sK58)
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK54
| app(cons(X4,nil),X5) != sK53
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(sK56,nil)
| ( sK56 = app(sK58,cons(sK57,nil))
& sK55 = 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(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(f558,plain,
( ~ neq(sK56,nil)
| sK55 = app(cons(sK57,nil),sK58) ),
inference(cnf_transformation,[],[f349]) ).
fof(f559,plain,
( ~ neq(sK56,nil)
| sK56 = app(sK58,cons(sK57,nil)) ),
inference(cnf_transformation,[],[f349]) ).
fof(f560,plain,
( neq(sK54,nil)
| nil = sK54 ),
inference(cnf_transformation,[],[f349]) ).
fof(f561,plain,
( neq(sK54,nil)
| nil != sK53 ),
inference(cnf_transformation,[],[f349]) ).
fof(f562,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK54
| app(cons(X4,nil),X5) != sK53
| ~ ssList(X5)
| ~ ssItem(X4)
| nil = sK54 ),
inference(cnf_transformation,[],[f349]) ).
fof(f563,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK54
| app(cons(X4,nil),X5) != sK53
| ~ ssList(X5)
| ~ ssItem(X4)
| nil != sK53 ),
inference(cnf_transformation,[],[f349]) ).
fof(f564,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK56
| app(cons(X4,nil),X5) != sK55
| ~ ssList(X5)
| ~ ssItem(X4)
| nil != sK55 ),
inference(definition_unfolding,[],[f563,f553,f554,f554]) ).
fof(f565,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK56
| app(cons(X4,nil),X5) != sK55
| ~ ssList(X5)
| ~ ssItem(X4)
| nil = sK56 ),
inference(definition_unfolding,[],[f562,f553,f554,f553]) ).
fof(f566,plain,
( neq(sK56,nil)
| nil != sK55 ),
inference(definition_unfolding,[],[f561,f553,f554]) ).
fof(f567,plain,
( neq(sK56,nil)
| nil = sK56 ),
inference(definition_unfolding,[],[f560,f553,f553]) ).
cnf(c_246,negated_conjecture,
( app(cons(X0,nil),X1) != sK55
| app(X1,cons(X0,nil)) != sK56
| nil != sK55
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f564]) ).
cnf(c_247,negated_conjecture,
( app(cons(X0,nil),X1) != sK55
| app(X1,cons(X0,nil)) != sK56
| ~ ssItem(X0)
| ~ ssList(X1)
| nil = sK56 ),
inference(cnf_transformation,[],[f565]) ).
cnf(c_248,negated_conjecture,
( nil != sK55
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f566]) ).
cnf(c_249,negated_conjecture,
( nil = sK56
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f567]) ).
cnf(c_250,negated_conjecture,
( ~ neq(sK56,nil)
| app(sK58,cons(sK57,nil)) = sK56 ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_251,negated_conjecture,
( ~ neq(sK56,nil)
| app(cons(sK57,nil),sK58) = sK55 ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_252,negated_conjecture,
( ~ neq(sK56,nil)
| ssList(sK58) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_253,negated_conjecture,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_254,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_367,negated_conjecture,
ssItem(sK57),
inference(global_subsumption_just,[status(thm)],[c_253,c_253,c_249,c_248,c_254]) ).
cnf(c_369,negated_conjecture,
ssList(sK58),
inference(global_subsumption_just,[status(thm)],[c_252,c_252,c_249,c_248,c_254]) ).
cnf(c_377,negated_conjecture,
neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_249,c_249,c_248,c_254]) ).
cnf(c_387,negated_conjecture,
app(cons(sK57,nil),sK58) = sK55,
inference(global_subsumption_just,[status(thm)],[c_251,c_251,c_377]) ).
cnf(c_389,negated_conjecture,
app(sK58,cons(sK57,nil)) = sK56,
inference(global_subsumption_just,[status(thm)],[c_250,c_249,c_248,c_254,c_250]) ).
cnf(c_397,plain,
( ~ ssList(X1)
| ~ ssItem(X0)
| app(X1,cons(X0,nil)) != sK56
| app(cons(X0,nil),X1) != sK55 ),
inference(global_subsumption_just,[status(thm)],[c_247,c_254,c_247,c_246]) ).
cnf(c_398,negated_conjecture,
( app(cons(X0,nil),X1) != sK55
| app(X1,cons(X0,nil)) != sK56
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(renaming,[status(thm)],[c_397]) ).
cnf(c_400,plain,
( app(X1,cons(X0,nil)) != sK56
| app(cons(X0,nil),X1) != sK55
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(global_subsumption_just,[status(thm)],[c_246,c_398]) ).
cnf(c_401,negated_conjecture,
( app(cons(X0,nil),X1) != sK55
| app(X1,cons(X0,nil)) != sK56
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(renaming,[status(thm)],[c_400]) ).
cnf(c_11681,plain,
( app(sK58,cons(sK57,nil)) != sK56
| ~ ssItem(sK57)
| ~ ssList(sK58) ),
inference(superposition,[status(thm)],[c_387,c_401]) ).
cnf(c_11682,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11681,c_369,c_367,c_389]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC320+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 15:07:09 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.47/1.17 % SZS status Started for theBenchmark.p
% 0.47/1.17 % SZS status Theorem for theBenchmark.p
% 0.47/1.17
% 0.47/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.47/1.17
% 0.47/1.17 ------ iProver source info
% 0.47/1.17
% 0.47/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.47/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.47/1.17 git: non_committed_changes: false
% 0.47/1.17 git: last_make_outside_of_git: false
% 0.47/1.17
% 0.47/1.17 ------ Parsing...
% 0.47/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.47/1.17
% 0.47/1.17 ------ 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.47/1.17
% 0.47/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.17
% 0.47/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.47/1.17 ------ Proving...
% 0.47/1.17 ------ Problem Properties
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 clauses 188
% 0.47/1.17 conjectures 7
% 0.47/1.17 EPR 54
% 0.47/1.17 Horn 120
% 0.47/1.17 unary 23
% 0.47/1.17 binary 40
% 0.47/1.17 lits 629
% 0.47/1.17 lits eq 83
% 0.47/1.17 fd_pure 0
% 0.47/1.17 fd_pseudo 0
% 0.47/1.17 fd_cond 21
% 0.47/1.17 fd_pseudo_cond 14
% 0.47/1.17 AC symbols 0
% 0.47/1.17
% 0.47/1.17 ------ Schedule dynamic 5 is on
% 0.47/1.17
% 0.47/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------
% 0.47/1.17 Current options:
% 0.47/1.17 ------
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------ Proving...
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 % SZS status Theorem for theBenchmark.p
% 0.47/1.17
% 0.47/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.17
% 0.47/1.17
%------------------------------------------------------------------------------