TSTP Solution File: SWC028+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC028+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:10:56 EDT 2024
% Result : Theorem 0.46s 1.15s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f596)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax52) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| 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)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f167,plain,
! [X0] :
( ( rearsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f329,plain,
! [X0] :
( ( ( rearsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ rearsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f167]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil != X1
& nil = sK53 )
| ( nil != sK53
& nil = X1 ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil != X1
& nil = sK53 )
| ( nil != sK53
& nil = X1 ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f222,f346,f345,f344,f343]) ).
fof(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f487,plain,
! [X0] :
( nil = X0
| ~ rearsegP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f329]) ).
fof(f547,plain,
ssList(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
( nil = sK53
| nil = sK54 ),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
( nil != sK54
| nil != sK53 ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
( neq(sK55,nil)
| nil = sK56 ),
inference(cnf_transformation,[],[f347]) ).
fof(f558,plain,
( neq(sK55,nil)
| nil = sK55 ),
inference(cnf_transformation,[],[f347]) ).
fof(f559,plain,
( rearsegP(sK56,sK55)
| nil = sK56 ),
inference(cnf_transformation,[],[f347]) ).
fof(f560,plain,
( rearsegP(sK56,sK55)
| nil = sK55 ),
inference(cnf_transformation,[],[f347]) ).
fof(f561,plain,
( nil != sK56
| nil != sK55 ),
inference(definition_unfolding,[],[f556,f551,f552]) ).
fof(f564,plain,
( nil = sK55
| nil = sK56 ),
inference(definition_unfolding,[],[f553,f552,f551]) ).
fof(f566,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f596]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_189,plain,
( ~ rearsegP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f487]) ).
cnf(c_246,negated_conjecture,
( nil = sK55
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_247,negated_conjecture,
( nil = sK56
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_248,negated_conjecture,
( nil = sK55
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_249,negated_conjecture,
( nil = sK56
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_250,negated_conjecture,
( nil != sK56
| nil != sK55 ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_251,negated_conjecture,
( nil = sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f564]) ).
cnf(c_255,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f566]) ).
cnf(c_368,negated_conjecture,
neq(sK55,nil),
inference(global_subsumption_just,[status(thm)],[c_249,c_249,c_248,c_250]) ).
cnf(c_370,negated_conjecture,
neq(sK55,nil),
inference(global_subsumption_just,[status(thm)],[c_248,c_368]) ).
cnf(c_372,negated_conjecture,
rearsegP(sK56,sK55),
inference(global_subsumption_just,[status(thm)],[c_247,c_247,c_246,c_250]) ).
cnf(c_390,plain,
( nil = sK56
| nil = sK55 ),
inference(prop_impl_just,[status(thm)],[c_251]) ).
cnf(c_418,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(prop_impl_just,[status(thm)],[c_139]) ).
cnf(c_800,plain,
( X0 != nil
| X0 != sK55
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_418,c_370]) ).
cnf(c_801,plain,
( nil != sK55
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_800]) ).
cnf(c_802,plain,
nil != sK55,
inference(global_subsumption_just,[status(thm)],[c_801,c_141,c_801]) ).
cnf(c_810,plain,
nil = sK56,
inference(backward_subsumption_resolution,[status(thm)],[c_390,c_802]) ).
cnf(c_4081,plain,
nil = sK56,
inference(subtyping,[status(esa)],[c_810]) ).
cnf(c_4082,plain,
nil != sK55,
inference(subtyping,[status(esa)],[c_802]) ).
cnf(c_4092,negated_conjecture,
rearsegP(sK56,sK55),
inference(subtyping,[status(esa)],[c_372]) ).
cnf(c_4142,plain,
( ~ rearsegP(nil,X0_13)
| ~ ssList(X0_13)
| X0_13 = nil ),
inference(subtyping,[status(esa)],[c_189]) ).
cnf(c_4942,plain,
rearsegP(nil,sK55),
inference(demodulation,[status(thm)],[c_4092,c_4081]) ).
cnf(c_5677,plain,
( ~ ssList(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_4942,c_4142]) ).
cnf(c_5682,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_5677,c_4082,c_255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC028+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n031.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 00:01:16 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.46/1.15 % SZS status Started for theBenchmark.p
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.15
% 0.46/1.15 ------ iProver source info
% 0.46/1.15
% 0.46/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.15 git: non_committed_changes: false
% 0.46/1.15
% 0.46/1.15 ------ Parsing...
% 0.46/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... sup_sim: 0 pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 pe_s pe_e
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e scvd_s sp: 0 0s scvd_e snvd_s sp: 0 0s snvd_e
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing...
% 0.46/1.15 ------ Proving...
% 0.46/1.15 ------ Problem Properties
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 clauses 185
% 0.46/1.15 conjectures 3
% 0.46/1.15 EPR 54
% 0.46/1.15 Horn 117
% 0.46/1.15 unary 21
% 0.46/1.15 binary 40
% 0.46/1.15 lits 623
% 0.46/1.15 lits eq 80
% 0.46/1.15 fd_pure 0
% 0.46/1.15 fd_pseudo 0
% 0.46/1.15 fd_cond 21
% 0.46/1.15 fd_pseudo_cond 14
% 0.46/1.15 AC symbols 0
% 0.46/1.15
% 0.46/1.15 ------ Input Options Time Limit: Unbounded
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------
% 0.46/1.15 Current options:
% 0.46/1.15 ------
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------ Proving...
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 % SZS status Theorem for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.15
% 0.46/1.15
%------------------------------------------------------------------------------