TSTP Solution File: SWC051+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC051+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 : Mon Jun 24 16:22:10 EDT 2024
% Result : Theorem 4.30s 1.20s
% Output : CNFRefutation 4.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 245 ( 56 equ)
% Maximal formula atoms : 32 ( 7 avg)
% Number of connectives : 318 ( 108 ~; 89 |; 108 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 53 ( 0 sgn 24 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| 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) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f163,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& 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) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& 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) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = sK55 )
& ! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = sK55 )
& ! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ~ neq(sK56,nil) )
& ( nil != sK56
| nil = sK55 )
& ! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ~ neq(sK56,nil) )
& ( nil != sK56
| nil = sK55 )
& ! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& 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])],[f222,f346,f345,f344,f343]) ).
fof(f484,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f163]) ).
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),
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
( neq(sK55,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
( rearsegP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f558,plain,
! [X4] :
( ~ rearsegP(sK55,X4)
| ~ rearsegP(sK56,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f554,f552,f551]) ).
fof(f559,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f553,f551]) ).
fof(f561,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
cnf(c_185,plain,
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(cnf_transformation,[],[f484]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_247,negated_conjecture,
( ~ neq(sK56,nil)
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_249,negated_conjecture,
( ~ neq(X0,nil)
| ~ rearsegP(sK56,X0)
| ~ rearsegP(sK55,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_250,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f559]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f561]) ).
cnf(c_367,negated_conjecture,
neq(sK55,nil),
inference(global_subsumption_just,[status(thm)],[c_247,c_250,c_247]) ).
cnf(c_3278,plain,
( X0 != sK55
| nil != nil
| ~ rearsegP(sK56,X0)
| ~ rearsegP(sK55,X0)
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_367,c_249]) ).
cnf(c_3279,plain,
( ~ rearsegP(sK56,sK55)
| ~ rearsegP(sK55,sK55)
| ~ ssList(sK55) ),
inference(unflattening,[status(thm)],[c_3278]) ).
cnf(c_3280,plain,
~ rearsegP(sK55,sK55),
inference(global_subsumption_just,[status(thm)],[c_3279,c_254,c_250,c_246,c_3279]) ).
cnf(c_8902,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_254]) ).
cnf(c_11824,plain,
~ ssList(sK55),
inference(superposition,[status(thm)],[c_185,c_3280]) ).
cnf(c_11825,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11824,c_8902]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC051+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Jun 20 02:20:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 4.30/1.20 % SZS status Started for theBenchmark.p
% 4.30/1.20 % SZS status Theorem for theBenchmark.p
% 4.30/1.20
% 4.30/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.30/1.20
% 4.30/1.20 ------ iProver source info
% 4.30/1.20
% 4.30/1.20 git: date: 2024-06-12 09:56:46 +0000
% 4.30/1.20 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 4.30/1.20 git: non_committed_changes: false
% 4.30/1.20
% 4.30/1.20 ------ Parsing...
% 4.30/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.30/1.20
% 4.30/1.20 ------ 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
% 4.30/1.20
% 4.30/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.30/1.20
% 4.30/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.30/1.20 ------ Proving...
% 4.30/1.20 ------ Problem Properties
% 4.30/1.20
% 4.30/1.20
% 4.30/1.20 clauses 188
% 4.30/1.20 conjectures 3
% 4.30/1.20 EPR 57
% 4.30/1.20 Horn 120
% 4.30/1.20 unary 22
% 4.30/1.20 binary 41
% 4.30/1.20 lits 630
% 4.30/1.20 lits eq 81
% 4.30/1.20 fd_pure 0
% 4.30/1.20 fd_pseudo 0
% 4.30/1.20 fd_cond 22
% 4.30/1.20 fd_pseudo_cond 14
% 4.30/1.20 AC symbols 0
% 4.30/1.20
% 4.30/1.20 ------ Schedule dynamic 5 is on
% 4.30/1.20
% 4.30/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.30/1.20
% 4.30/1.20
% 4.30/1.20 ------
% 4.30/1.20 Current options:
% 4.30/1.20 ------
% 4.30/1.20
% 4.30/1.20
% 4.30/1.20
% 4.30/1.20
% 4.30/1.20 ------ Proving...
% 4.30/1.20
% 4.30/1.20
% 4.30/1.20 % SZS status Theorem for theBenchmark.p
% 4.30/1.20
% 4.30/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.30/1.20
% 4.30/1.21
%------------------------------------------------------------------------------