TSTP Solution File: SWC415+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC415+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:15 EDT 2023
% Result : Theorem 3.52s 1.19s
% Output : CNFRefutation 3.52s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f605)
% Comments :
%------------------------------------------------------------------------------
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(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax24) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X5] :
( neq(nil,X1)
& X0 = X5
& tl(X1) = X5
& ssList(X5) )
| ? [X4] :
( neq(nil,X3)
& tl(X3) = X4
& X2 != X4
& ssList(X4) )
| ~ 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)
| ~ neq(X1,nil) )
& ( ? [X5] :
( neq(nil,X1)
& X0 = X5
& tl(X1) = X5
& ssList(X5) )
| ? [X4] :
( neq(nil,X3)
& tl(X3) = X4
& X2 != X4
& ssList(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] :
( neq(nil,X1)
& X0 = X4
& tl(X1) = X4
& ssList(X4) )
| ? [X5] :
( neq(nil,X3)
& tl(X3) = X5
& X2 != X5
& ssList(X5) )
| ~ neq(X1,nil) ) )
| 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(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f131,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f130]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ~ neq(nil,X1)
| X0 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(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] :
( ~ neq(nil,X1)
| X0 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) ) )
& 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)
& neq(X1,nil) )
| ( ! [X4] :
( ~ neq(nil,X1)
| X0 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ~ neq(nil,X1)
| sK53 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ~ neq(nil,X1)
| sK53 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ! [X4] :
( ~ neq(nil,sK54)
| sK53 != X4
| tl(sK54) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(sK54,nil) ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ! [X4] :
( ~ neq(nil,sK54)
| sK53 != X4
| tl(sK54) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(sK54,nil) ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ! [X4] :
( ~ neq(nil,sK54)
| sK53 != X4
| tl(sK54) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| sK55 = X5
| ~ ssList(X5) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ! [X4] :
( ~ neq(nil,sK54)
| sK53 != X4
| tl(sK54) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| sK55 = X5
| ~ ssList(X5) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ! [X4] :
( ~ neq(nil,sK54)
| sK53 != X4
| tl(sK54) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,sK56)
| tl(sK56) != X5
| sK55 = X5
| ~ ssList(X5) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ! [X4] :
( ~ neq(nil,sK54)
| sK53 != X4
| tl(sK54) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,sK56)
| tl(sK56) != X5
| sK55 = X5
| ~ ssList(X5) )
& 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])],[f223,f347,f346,f345,f344]) ).
fof(f439,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f317]) ).
fof(f441,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f451,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f548,plain,
ssList(sK53),
inference(cnf_transformation,[],[f348]) ).
fof(f549,plain,
ssList(sK54),
inference(cnf_transformation,[],[f348]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f556,plain,
! [X4] :
( neq(sK54,nil)
| ~ neq(nil,sK54)
| sK53 != X4
| tl(sK54) != X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
! [X5] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| tl(sK56) != X5
| sK55 = X5
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f348]) ).
fof(f559,plain,
! [X4] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK54)
| sK53 != X4
| tl(sK54) != X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f348]) ).
fof(f560,plain,
! [X4] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| sK55 != X4
| tl(sK56) != X4
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f559,f552,f553,f552]) ).
fof(f562,plain,
! [X4] :
( neq(sK56,nil)
| ~ neq(nil,sK56)
| sK55 != X4
| tl(sK56) != X4
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f556,f552,f552,f553,f552]) ).
fof(f565,plain,
ssList(sK56),
inference(definition_unfolding,[],[f549,f552]) ).
fof(f566,plain,
ssList(sK55),
inference(definition_unfolding,[],[f548,f553]) ).
fof(f594,plain,
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| sK55 != tl(sK56)
| ~ ssList(sK55) ),
inference(equality_resolution,[],[f560]) ).
fof(f595,plain,
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| sK55 = tl(sK56)
| ~ ssList(tl(sK56)) ),
inference(equality_resolution,[],[f558]) ).
fof(f596,plain,
( neq(sK56,nil)
| ~ neq(nil,sK56)
| sK55 != tl(sK56)
| ~ ssList(sK55) ),
inference(equality_resolution,[],[f562]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f439]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f600]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f441]) ).
cnf(c_151,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(tl(X0)) ),
inference(cnf_transformation,[],[f451]) ).
cnf(c_246,negated_conjecture,
( tl(sK56) != sK55
| ~ neq(nil,sK56)
| ~ neq(sK56,nil)
| ~ ssList(sK55) ),
inference(cnf_transformation,[],[f594]) ).
cnf(c_247,negated_conjecture,
( ~ neq(nil,sK56)
| ~ neq(sK56,nil)
| ~ ssList(tl(sK56))
| tl(sK56) = sK55 ),
inference(cnf_transformation,[],[f595]) ).
cnf(c_248,negated_conjecture,
( tl(sK56) != sK55
| ~ neq(nil,sK56)
| ~ ssList(sK55)
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f596]) ).
cnf(c_250,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f605]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f565]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f566]) ).
cnf(c_375,negated_conjecture,
neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_248,c_250]) ).
cnf(c_383,plain,
( ~ ssList(tl(sK56))
| ~ neq(nil,sK56) ),
inference(global_subsumption_just,[status(thm)],[c_247,c_254,c_250,c_247,c_246]) ).
cnf(c_384,negated_conjecture,
( ~ neq(nil,sK56)
| ~ ssList(tl(sK56)) ),
inference(renaming,[status(thm)],[c_383]) ).
cnf(c_3230,plain,
( X0 != nil
| X1 != sK56
| ~ ssList(tl(sK56))
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_384]) ).
cnf(c_3231,plain,
( ~ ssList(tl(sK56))
| ~ ssList(nil)
| ~ ssList(sK56)
| nil = sK56 ),
inference(unflattening,[status(thm)],[c_3230]) ).
cnf(c_3232,plain,
( ~ ssList(tl(sK56))
| nil = sK56 ),
inference(global_subsumption_just,[status(thm)],[c_3231,c_253,c_141,c_3231]) ).
cnf(c_3248,plain,
( X0 != nil
| X0 != sK56
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_139,c_375]) ).
cnf(c_3249,plain,
( nil != sK56
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3248]) ).
cnf(c_3250,plain,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_3249,c_141,c_3249]) ).
cnf(c_3256,plain,
~ ssList(tl(sK56)),
inference(backward_subsumption_resolution,[status(thm)],[c_3232,c_3250]) ).
cnf(c_12139,plain,
( ~ ssList(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_151,c_3256]) ).
cnf(c_12140,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12139,c_3250,c_253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC415+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 16:19:35 EDT 2023
% 0.20/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.52/1.19 % SZS status Started for theBenchmark.p
% 3.52/1.19 % SZS status Theorem for theBenchmark.p
% 3.52/1.19
% 3.52/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.52/1.19
% 3.52/1.19 ------ iProver source info
% 3.52/1.19
% 3.52/1.19 git: date: 2023-05-31 18:12:56 +0000
% 3.52/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.52/1.19 git: non_committed_changes: false
% 3.52/1.19 git: last_make_outside_of_git: false
% 3.52/1.19
% 3.52/1.19 ------ Parsing...
% 3.52/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.52/1.19
% 3.52/1.19 ------ 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
% 3.52/1.19
% 3.52/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.52/1.19
% 3.52/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.52/1.19 ------ Proving...
% 3.52/1.19 ------ Problem Properties
% 3.52/1.19
% 3.52/1.19
% 3.52/1.19 clauses 185
% 3.52/1.19 conjectures 2
% 3.52/1.19 EPR 52
% 3.52/1.19 Horn 117
% 3.52/1.19 unary 21
% 3.52/1.19 binary 40
% 3.52/1.19 lits 623
% 3.52/1.19 lits eq 80
% 3.52/1.19 fd_pure 0
% 3.52/1.19 fd_pseudo 0
% 3.52/1.19 fd_cond 21
% 3.52/1.19 fd_pseudo_cond 14
% 3.52/1.19 AC symbols 0
% 3.52/1.19
% 3.52/1.19 ------ Schedule dynamic 5 is on
% 3.52/1.19
% 3.52/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.52/1.19
% 3.52/1.19
% 3.52/1.19 ------
% 3.52/1.19 Current options:
% 3.52/1.19 ------
% 3.52/1.19
% 3.52/1.19
% 3.52/1.19
% 3.52/1.19
% 3.52/1.19 ------ Proving...
% 3.52/1.19
% 3.52/1.19
% 3.52/1.19 % SZS status Theorem for theBenchmark.p
% 3.52/1.19
% 3.52/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.52/1.19
% 3.52/1.19
%------------------------------------------------------------------------------