TSTP Solution File: SWC050+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC050+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:40:36 EDT 2023
% Result : Theorem 1.47s 1.18s
% Output : CNFRefutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 49 ( 9 unt; 0 def)
% Number of atoms : 298 ( 54 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 369 ( 120 ~; 109 |; 120 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 141 ( 20 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] :
( ssList(X5)
=> ( ~ rearsegP(X2,X5)
| ~ rearsegP(X3,X5)
| ~ neq(X5,nil) ) )
| ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& 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] :
( ssList(X5)
=> ( ~ rearsegP(X2,X5)
| ~ rearsegP(X3,X5)
| ~ neq(X5,nil) ) )
| ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& 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] :
( ssList(X4)
=> ( ~ rearsegP(X2,X4)
| ~ rearsegP(X3,X4)
| ~ neq(X4,nil) ) )
| ? [X5] :
( rearsegP(X0,X5)
& rearsegP(X1,X5)
& neq(X5,nil)
& ssList(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] :
( rearsegP(X2,X4)
& rearsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) )
& ! [X5] :
( ~ rearsegP(X0,X5)
| ~ rearsegP(X1,X5)
| ~ neq(X5,nil)
| ~ 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] :
( rearsegP(X2,X4)
& rearsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) )
& ! [X5] :
( ~ rearsegP(X0,X5)
| ~ rearsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f233,plain,
! [X2,X3,X0,X1] :
( ( ? [X4] :
( rearsegP(X2,X4)
& rearsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) )
& ! [X5] :
( ~ rearsegP(X0,X5)
| ~ rearsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil) )
| ~ sP6(X2,X3,X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f234,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X2,X3,X0,X1) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f223,f233]) ).
fof(f346,plain,
! [X2,X3,X0,X1] :
( ( ? [X4] :
( rearsegP(X2,X4)
& rearsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) )
& ! [X5] :
( ~ rearsegP(X0,X5)
| ~ rearsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil) )
| ~ sP6(X2,X3,X0,X1) ),
inference(nnf_transformation,[],[f233]) ).
fof(f347,plain,
! [X0,X1,X2,X3] :
( ( ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
& ! [X5] :
( ~ rearsegP(X2,X5)
| ~ rearsegP(X3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X3,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(rectify,[],[f346]) ).
fof(f348,plain,
! [X0,X1] :
( ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
=> ( rearsegP(X0,sK54(X0,X1))
& rearsegP(X1,sK54(X0,X1))
& neq(sK54(X0,X1),nil)
& ssList(sK54(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
! [X0,X1,X2,X3] :
( ( rearsegP(X0,sK54(X0,X1))
& rearsegP(X1,sK54(X0,X1))
& neq(sK54(X0,X1),nil)
& ssList(sK54(X0,X1))
& ! [X5] :
( ~ rearsegP(X2,X5)
| ~ rearsegP(X3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X3,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(X2,X3,X0,X1) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X2,X3,sK55,X1) )
& 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(X2,X3,sK55,X1) )
& sK55 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK56,nil) )
| sP6(X2,X3,sK55,sK56) )
& 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(X2,X3,sK55,sK56) )
& sK55 = X2
& sK56 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK56,nil) )
| sP6(sK57,X3,sK55,sK56) )
& sK55 = sK57
& sK56 = X3
& ssList(X3) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f353,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK56,nil) )
| sP6(sK57,X3,sK55,sK56) )
& sK55 = sK57
& sK56 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK58,nil)
& neq(sK56,nil) )
| sP6(sK57,sK58,sK55,sK56) )
& sK55 = sK57
& sK56 = sK58
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f354,plain,
( ( ( ~ neq(sK58,nil)
& neq(sK56,nil) )
| sP6(sK57,sK58,sK55,sK56) )
& 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] :
( ~ rearsegP(X2,X5)
| ~ rearsegP(X3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
! [X2,X3,X0,X1] :
( ssList(sK54(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f557,plain,
! [X2,X3,X0,X1] :
( neq(sK54(X0,X1),nil)
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f558,plain,
! [X2,X3,X0,X1] :
( rearsegP(X1,sK54(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f559,plain,
! [X2,X3,X0,X1] :
( rearsegP(X0,sK54(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f349]) ).
fof(f564,plain,
sK56 = sK58,
inference(cnf_transformation,[],[f354]) ).
fof(f565,plain,
sK55 = sK57,
inference(cnf_transformation,[],[f354]) ).
fof(f566,plain,
( neq(sK56,nil)
| sP6(sK57,sK58,sK55,sK56) ),
inference(cnf_transformation,[],[f354]) ).
fof(f567,plain,
( ~ neq(sK58,nil)
| sP6(sK57,sK58,sK55,sK56) ),
inference(cnf_transformation,[],[f354]) ).
fof(f568,plain,
( ~ neq(sK58,nil)
| sP6(sK57,sK58,sK57,sK58) ),
inference(definition_unfolding,[],[f567,f565,f564]) ).
fof(f569,plain,
( neq(sK58,nil)
| sP6(sK57,sK58,sK57,sK58) ),
inference(definition_unfolding,[],[f566,f564,f565,f564]) ).
cnf(c_246,plain,
( ~ sP6(X0,X1,X2,X3)
| rearsegP(X0,sK54(X0,X1)) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_247,plain,
( ~ sP6(X0,X1,X2,X3)
| rearsegP(X1,sK54(X0,X1)) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_248,plain,
( ~ sP6(X0,X1,X2,X3)
| neq(sK54(X0,X1),nil) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_249,plain,
( ~ sP6(X0,X1,X2,X3)
| ssList(sK54(X0,X1)) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_250,plain,
( ~ sP6(X0,X1,X2,X3)
| ~ rearsegP(X2,X4)
| ~ rearsegP(X3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_252,negated_conjecture,
( ~ neq(sK58,nil)
| sP6(sK57,sK58,sK57,sK58) ),
inference(cnf_transformation,[],[f568]) ).
cnf(c_253,negated_conjecture,
( sP6(sK57,sK58,sK57,sK58)
| neq(sK58,nil) ),
inference(cnf_transformation,[],[f569]) ).
cnf(c_375,negated_conjecture,
sP6(sK57,sK58,sK57,sK58),
inference(global_subsumption_just,[status(thm)],[c_253,c_253,c_252]) ).
cnf(c_377,negated_conjecture,
sP6(sK57,sK58,sK57,sK58),
inference(global_subsumption_just,[status(thm)],[c_252,c_375]) ).
cnf(c_3222,plain,
( X0 != sK57
| X1 != sK58
| X2 != sK57
| X3 != sK58
| ~ rearsegP(X2,X4)
| ~ rearsegP(X3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(resolution_lifted,[status(thm)],[c_250,c_377]) ).
cnf(c_3223,plain,
( ~ neq(X0,nil)
| ~ rearsegP(sK58,X0)
| ~ rearsegP(sK57,X0)
| ~ ssList(X0) ),
inference(unflattening,[status(thm)],[c_3222]) ).
cnf(c_3236,plain,
( X0 != sK57
| X1 != sK58
| X2 != sK57
| X3 != sK58
| ssList(sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_249,c_377]) ).
cnf(c_3237,plain,
ssList(sK54(sK57,sK58)),
inference(unflattening,[status(thm)],[c_3236]) ).
cnf(c_3241,plain,
( X0 != sK57
| X1 != sK58
| X2 != sK57
| X3 != sK58
| neq(sK54(X0,X1),nil) ),
inference(resolution_lifted,[status(thm)],[c_248,c_377]) ).
cnf(c_3242,plain,
neq(sK54(sK57,sK58),nil),
inference(unflattening,[status(thm)],[c_3241]) ).
cnf(c_3246,plain,
( X0 != sK57
| X1 != sK58
| X2 != sK57
| X3 != sK58
| rearsegP(X1,sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_247,c_377]) ).
cnf(c_3247,plain,
rearsegP(sK58,sK54(sK57,sK58)),
inference(unflattening,[status(thm)],[c_3246]) ).
cnf(c_3251,plain,
( X0 != sK57
| X1 != sK58
| X2 != sK57
| X3 != sK58
| rearsegP(X0,sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_246,c_377]) ).
cnf(c_3252,plain,
rearsegP(sK57,sK54(sK57,sK58)),
inference(unflattening,[status(thm)],[c_3251]) ).
cnf(c_3367,plain,
( sK54(sK57,sK58) != X0
| nil != nil
| ~ rearsegP(sK58,X0)
| ~ rearsegP(sK57,X0)
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_3223,c_3242]) ).
cnf(c_3368,plain,
( ~ rearsegP(sK58,sK54(sK57,sK58))
| ~ rearsegP(sK57,sK54(sK57,sK58))
| ~ ssList(sK54(sK57,sK58)) ),
inference(unflattening,[status(thm)],[c_3367]) ).
cnf(c_3369,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3368,c_3252,c_3247,c_3237]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC050+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n026.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 18:01:50 EDT 2023
% 0.14/0.35 % 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
% 1.47/1.18 % SZS status Started for theBenchmark.p
% 1.47/1.18 % SZS status Theorem for theBenchmark.p
% 1.47/1.18
% 1.47/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.47/1.18
% 1.47/1.18 ------ iProver source info
% 1.47/1.18
% 1.47/1.18 git: date: 2023-05-31 18:12:56 +0000
% 1.47/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.47/1.18 git: non_committed_changes: false
% 1.47/1.18 git: last_make_outside_of_git: false
% 1.47/1.18
% 1.47/1.18 ------ Parsing...
% 1.47/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.47/1.18
% 1.47/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s
% 1.47/1.18
% 1.47/1.18 % SZS status Theorem for theBenchmark.p
% 1.47/1.18
% 1.47/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.47/1.18
% 1.47/1.18
%------------------------------------------------------------------------------