TSTP Solution File: SWC069+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC069+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:06 EDT 2024
% Result : Theorem 3.96s 1.17s
% Output : CNFRefutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 60 ( 17 unt; 0 def)
% Number of atoms : 372 ( 109 equ)
% Maximal formula atoms : 38 ( 6 avg)
% Number of connectives : 484 ( 172 ~; 143 |; 145 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 78 ( 0 sgn 36 !; 38 ?)
% 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(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X2,X5)
| ~ segmentP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| 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)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X2,X5)
| ~ segmentP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| 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)
& ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| 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(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& 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)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& 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)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK53
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK53
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(sK55,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ( nil != X3
| nil = sK55 )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(sK55,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ( nil != X3
| nil = sK55 )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ~ neq(sK56,nil)
| ? [X4] :
( segmentP(sK55,X4)
& segmentP(sK56,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK53
| nil != sK54 )
& ( nil != sK56
| nil = sK55 )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( segmentP(sK55,X4)
& segmentP(sK56,X4)
& neq(X4,nil)
& ssList(X4) )
=> ( segmentP(sK55,sK57)
& segmentP(sK56,sK57)
& neq(sK57,nil)
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ( ~ neq(sK56,nil)
| ( segmentP(sK55,sK57)
& segmentP(sK56,sK57)
& neq(sK57,nil)
& ssList(sK57) ) )
& ( nil != sK53
| nil != sK54 )
& ( nil != sK56
| nil = sK55 )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f223,f348,f347,f346,f345,f344]) ).
fof(f440,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f317]) ).
fof(f442,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f550,plain,
ssList(sK54),
inference(cnf_transformation,[],[f349]) ).
fof(f553,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f349]) ).
fof(f554,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f349]) ).
fof(f555,plain,
! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f349]) ).
fof(f557,plain,
( nil != sK53
| nil != sK54 ),
inference(cnf_transformation,[],[f349]) ).
fof(f558,plain,
( ~ neq(sK56,nil)
| ssList(sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f559,plain,
( ~ neq(sK56,nil)
| neq(sK57,nil) ),
inference(cnf_transformation,[],[f349]) ).
fof(f560,plain,
( ~ neq(sK56,nil)
| segmentP(sK56,sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f561,plain,
( ~ neq(sK56,nil)
| segmentP(sK55,sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f562,plain,
( nil != sK55
| nil != sK56 ),
inference(definition_unfolding,[],[f557,f554,f553]) ).
fof(f563,plain,
! [X5] :
( ~ segmentP(sK55,X5)
| ~ segmentP(sK56,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f555,f554,f553]) ).
fof(f564,plain,
ssList(sK56),
inference(definition_unfolding,[],[f550,f553]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f440]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f442]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| segmentP(sK55,sK57) ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_247,negated_conjecture,
( ~ neq(sK56,nil)
| segmentP(sK56,sK57) ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_248,negated_conjecture,
( ~ neq(sK56,nil)
| neq(sK57,nil) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_249,negated_conjecture,
( ~ neq(sK56,nil)
| ssList(sK57) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_250,negated_conjecture,
( nil != sK56
| nil != sK55 ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_251,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_252,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_255,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f564]) ).
cnf(c_369,negated_conjecture,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_251,c_251,c_250]) ).
cnf(c_373,negated_conjecture,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_250,c_369]) ).
cnf(c_8916,negated_conjecture,
nil != sK56,
inference(demodulation,[status(thm)],[c_373]) ).
cnf(c_8918,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_255]) ).
cnf(c_8919,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0) ),
inference(demodulation,[status(thm)],[c_252]) ).
cnf(c_8920,negated_conjecture,
( ~ neq(sK56,nil)
| ssList(sK57) ),
inference(demodulation,[status(thm)],[c_249]) ).
cnf(c_8921,negated_conjecture,
( ~ neq(sK56,nil)
| neq(sK57,nil) ),
inference(demodulation,[status(thm)],[c_248]) ).
cnf(c_8922,negated_conjecture,
( ~ neq(sK56,nil)
| segmentP(sK56,sK57) ),
inference(demodulation,[status(thm)],[c_247]) ).
cnf(c_8923,negated_conjecture,
( ~ neq(sK56,nil)
| segmentP(sK55,sK57) ),
inference(demodulation,[status(thm)],[c_246]) ).
cnf(c_13209,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| nil = sK56
| segmentP(sK55,sK57) ),
inference(superposition,[status(thm)],[c_138,c_8923]) ).
cnf(c_13210,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| nil = sK56
| segmentP(sK56,sK57) ),
inference(superposition,[status(thm)],[c_138,c_8922]) ).
cnf(c_13211,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| nil = sK56
| neq(sK57,nil) ),
inference(superposition,[status(thm)],[c_138,c_8921]) ).
cnf(c_13212,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| nil = sK56
| ssList(sK57) ),
inference(superposition,[status(thm)],[c_138,c_8920]) ).
cnf(c_13214,plain,
ssList(sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_13212,c_8916,c_8918,c_141]) ).
cnf(c_13215,plain,
neq(sK57,nil),
inference(forward_subsumption_resolution,[status(thm)],[c_13211,c_8916,c_8918,c_141]) ).
cnf(c_13216,plain,
segmentP(sK56,sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_13210,c_8916,c_8918,c_141]) ).
cnf(c_13217,plain,
segmentP(sK55,sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_13209,c_8916,c_8918,c_141]) ).
cnf(c_13241,plain,
( ~ segmentP(sK56,sK57)
| ~ segmentP(sK55,sK57)
| ~ ssList(sK57) ),
inference(superposition,[status(thm)],[c_13215,c_8919]) ).
cnf(c_13242,plain,
( ~ segmentP(sK56,sK57)
| ~ segmentP(sK55,sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13241,c_13214]) ).
cnf(c_13245,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_13242,c_13216,c_13217]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC069+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 : Thu May 2 23:39:13 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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
% 3.96/1.17 % SZS status Started for theBenchmark.p
% 3.96/1.17 % SZS status Theorem for theBenchmark.p
% 3.96/1.17
% 3.96/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.96/1.17
% 3.96/1.17 ------ iProver source info
% 3.96/1.17
% 3.96/1.17 git: date: 2024-05-02 19:28:25 +0000
% 3.96/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.96/1.17 git: non_committed_changes: false
% 3.96/1.17
% 3.96/1.17 ------ Parsing...
% 3.96/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.96/1.17
% 3.96/1.17 ------ 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: 4 0s sf_e pe_s pe_e
% 3.96/1.17
% 3.96/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.96/1.17
% 3.96/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.96/1.17 ------ Proving...
% 3.96/1.17 ------ Problem Properties
% 3.96/1.17
% 3.96/1.17
% 3.96/1.17 clauses 192
% 3.96/1.17 conjectures 8
% 3.96/1.17 EPR 61
% 3.96/1.17 Horn 122
% 3.96/1.17 unary 19
% 3.96/1.17 binary 46
% 3.96/1.17 lits 645
% 3.96/1.17 lits eq 81
% 3.96/1.17 fd_pure 0
% 3.96/1.17 fd_pseudo 0
% 3.96/1.17 fd_cond 21
% 3.96/1.17 fd_pseudo_cond 16
% 3.96/1.17 AC symbols 0
% 3.96/1.17
% 3.96/1.17 ------ Schedule dynamic 5 is on
% 3.96/1.17
% 3.96/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.96/1.17
% 3.96/1.17
% 3.96/1.17 ------
% 3.96/1.17 Current options:
% 3.96/1.17 ------
% 3.96/1.17
% 3.96/1.17
% 3.96/1.17
% 3.96/1.17
% 3.96/1.17 ------ Proving...
% 3.96/1.17
% 3.96/1.17
% 3.96/1.17 % SZS status Theorem for theBenchmark.p
% 3.96/1.17
% 3.96/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.96/1.17
% 3.96/1.18
%------------------------------------------------------------------------------