TSTP Solution File: SWC105+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC105+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:11:15 EDT 2024
% Result : Theorem 0.37s 1.05s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f596)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/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 ) )
| ( ( ( rearsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| 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)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ( rearsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
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 ) )
& ( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( 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 ) )
& ( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f316,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
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 ) )
& ( ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( 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 ) )
& ( ( ( ~ rearsegP(X1,sK53)
| ~ neq(sK53,nil) )
& neq(X1,nil) )
| ( 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 ) )
& ( ( ( ~ rearsegP(X1,sK53)
| ~ neq(sK53,nil) )
& neq(X1,nil) )
| ( 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 ) )
& ( ( ( ~ rearsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil) )
| ( 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 ) )
& ( ( ( ~ rearsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ( ( ( ~ rearsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil) )
| ( 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 ) )
& ( ( ( ~ rearsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ( ( ( ~ rearsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil) )
| ( 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 ) )
& ( ( ( ~ rearsegP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil) )
| ( 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(f438,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f316]) ).
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,
( neq(sK54,nil)
| nil = sK54 ),
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
( neq(sK54,nil)
| nil != sK53 ),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
( ~ rearsegP(sK54,sK53)
| ~ neq(sK53,nil)
| nil = sK54 ),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
( ~ rearsegP(sK54,sK53)
| ~ neq(sK53,nil)
| nil != sK53 ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
( neq(sK55,nil)
| nil = sK56 ),
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,
( ~ rearsegP(sK56,sK55)
| ~ neq(sK55,nil)
| nil != sK55 ),
inference(definition_unfolding,[],[f556,f551,f552,f552,f552]) ).
fof(f562,plain,
( ~ rearsegP(sK56,sK55)
| ~ neq(sK55,nil)
| nil = sK56 ),
inference(definition_unfolding,[],[f555,f551,f552,f552,f551]) ).
fof(f563,plain,
( neq(sK56,nil)
| nil != sK55 ),
inference(definition_unfolding,[],[f554,f551,f552]) ).
fof(f564,plain,
( neq(sK56,nil)
| nil = sK56 ),
inference(definition_unfolding,[],[f553,f551,f551]) ).
fof(f566,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f438]) ).
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_249,negated_conjecture,
( nil = sK56
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_250,negated_conjecture,
( nil != sK55
| ~ neq(sK55,nil)
| ~ rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_251,negated_conjecture,
( ~ neq(sK55,nil)
| ~ rearsegP(sK56,sK55)
| nil = sK56 ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_252,negated_conjecture,
( nil != sK55
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_253,negated_conjecture,
( nil = sK56
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f564]) ).
cnf(c_257,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f566]) ).
cnf(c_287,plain,
( ~ neq(nil,nil)
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_139]) ).
cnf(c_370,negated_conjecture,
nil = sK56,
inference(global_subsumption_just,[status(thm)],[c_253,c_249,c_247,c_251]) ).
cnf(c_382,negated_conjecture,
nil = sK56,
inference(global_subsumption_just,[status(thm)],[c_251,c_370]) ).
cnf(c_1823,plain,
( nil = sK55
| rearsegP(nil,sK55) ),
inference(light_normalisation,[status(thm)],[c_246,c_382]) ).
cnf(c_1880,plain,
( nil != sK55
| neq(nil,nil) ),
inference(light_normalisation,[status(thm)],[c_252,c_382]) ).
cnf(c_2179,plain,
( nil != sK55
| ~ neq(sK55,nil)
| ~ rearsegP(nil,sK55) ),
inference(light_normalisation,[status(thm)],[c_250,c_382]) ).
cnf(c_3248,plain,
( X0 != sK55
| X1 != nil
| nil != sK55
| ~ rearsegP(nil,sK55)
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_2179]) ).
cnf(c_3249,plain,
( nil != sK55
| ~ rearsegP(nil,sK55)
| ~ ssList(nil)
| ~ ssList(sK55)
| sK55 = nil ),
inference(unflattening,[status(thm)],[c_3248]) ).
cnf(c_3250,plain,
nil != sK55,
inference(global_subsumption_just,[status(thm)],[c_3249,c_141,c_287,c_1880]) ).
cnf(c_3267,plain,
rearsegP(nil,sK55),
inference(backward_subsumption_resolution,[status(thm)],[c_1823,c_3250]) ).
cnf(c_8848,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_257]) ).
cnf(c_12659,plain,
( ~ ssList(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_3267,c_189]) ).
cnf(c_12660,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12659,c_3250,c_8848]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC105+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:26:31 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.41 Running first-order theorem proving
% 0.17/0.41 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
% 0.37/1.05 % SZS status Started for theBenchmark.p
% 0.37/1.05 % SZS status Theorem for theBenchmark.p
% 0.37/1.05
% 0.37/1.05 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.37/1.05
% 0.37/1.05 ------ iProver source info
% 0.37/1.05
% 0.37/1.05 git: date: 2024-05-02 19:28:25 +0000
% 0.37/1.05 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.37/1.05 git: non_committed_changes: false
% 0.37/1.05
% 0.37/1.05 ------ Parsing...
% 0.37/1.05 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.37/1.05
% 0.37/1.05 ------ Preprocessing... sup_sim: 5 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.37/1.05
% 0.37/1.05 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.37/1.05
% 0.37/1.05 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.37/1.05 ------ Proving...
% 0.37/1.05 ------ Problem Properties
% 0.37/1.05
% 0.37/1.05
% 0.37/1.05 clauses 184
% 0.37/1.05 conjectures 2
% 0.37/1.05 EPR 53
% 0.37/1.05 Horn 116
% 0.37/1.05 unary 20
% 0.37/1.05 binary 40
% 0.37/1.05 lits 622
% 0.37/1.05 lits eq 80
% 0.37/1.05 fd_pure 0
% 0.37/1.05 fd_pseudo 0
% 0.37/1.05 fd_cond 21
% 0.37/1.05 fd_pseudo_cond 14
% 0.37/1.05 AC symbols 0
% 0.37/1.05
% 0.37/1.05 ------ Schedule dynamic 5 is on
% 0.37/1.05
% 0.37/1.05 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.37/1.05
% 0.37/1.05
% 0.37/1.05 ------
% 0.37/1.05 Current options:
% 0.37/1.05 ------
% 0.37/1.05
% 0.37/1.05
% 0.37/1.05
% 0.37/1.05
% 0.37/1.05 ------ Proving...
% 0.37/1.05
% 0.37/1.05
% 0.37/1.05 % SZS status Theorem for theBenchmark.p
% 0.37/1.05
% 0.37/1.05 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.37/1.05
% 0.37/1.05
%------------------------------------------------------------------------------