TSTP Solution File: SWC206+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC206+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:35 EDT 2024
% Result : Theorem 0.43s 1.13s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f594)
% 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(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f96,conjecture,
! [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 = X3
& nil != X2 )
| neq(X0,nil)
| ~ 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)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ( nil = X3
& nil != X2 )
| neq(X0,nil)
| ~ neq(X1,nil)
| 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(f176,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& 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] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& neq(X1,nil)
& 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(f330,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f176]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& neq(X1,nil)
& 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 != X3
| nil = X2 )
& ~ neq(sK53,nil)
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK53,nil)
& neq(X1,nil)
& 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 != X3
| nil = X2 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& 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 != X3
| nil = sK55 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(sK55,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = sK55 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ~ neq(sK56,nil)
| ? [X4] :
( segmentP(sK55,X4)
& segmentP(sK56,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK56
| nil = sK55 )
& ~ neq(sK53,nil)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,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(f348,plain,
( ( ~ neq(sK56,nil)
| ( segmentP(sK55,sK57)
& segmentP(sK56,sK57)
& neq(sK57,nil)
& ssList(sK57) ) )
& ( nil != sK56
| nil = sK55 )
& ~ neq(sK53,nil)
& 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,sK57])],[f222,f347,f346,f345,f344,f343]) ).
fof(f439,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f316]) ).
fof(f441,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f495,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
fof(f548,plain,
ssList(sK53),
inference(cnf_transformation,[],[f348]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f554,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f348]) ).
fof(f555,plain,
~ neq(sK53,nil),
inference(cnf_transformation,[],[f348]) ).
fof(f557,plain,
( ~ neq(sK56,nil)
| ssList(sK57) ),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
( ~ neq(sK56,nil)
| neq(sK57,nil) ),
inference(cnf_transformation,[],[f348]) ).
fof(f560,plain,
( ~ neq(sK56,nil)
| segmentP(sK55,sK57) ),
inference(cnf_transformation,[],[f348]) ).
fof(f561,plain,
~ neq(sK55,nil),
inference(definition_unfolding,[],[f555,f553]) ).
fof(f562,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f554,f552]) ).
fof(f564,plain,
ssList(sK55),
inference(definition_unfolding,[],[f548,f553]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f439]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f594]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f441]) ).
cnf(c_196,plain,
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f495]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| segmentP(sK55,sK57) ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_248,negated_conjecture,
( ~ neq(sK56,nil)
| neq(sK57,nil) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_249,negated_conjecture,
( ~ neq(sK56,nil)
| ssList(sK57) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_251,negated_conjecture,
~ neq(sK55,nil),
inference(cnf_transformation,[],[f561]) ).
cnf(c_252,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f562]) ).
cnf(c_256,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f564]) ).
cnf(c_371,negated_conjecture,
neq(sK57,nil),
inference(global_subsumption_just,[status(thm)],[c_248,c_252,c_248]) ).
cnf(c_375,negated_conjecture,
segmentP(sK55,sK57),
inference(global_subsumption_just,[status(thm)],[c_246,c_252,c_246]) ).
cnf(c_415,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(prop_impl_just,[status(thm)],[c_139]) ).
cnf(c_799,plain,
( X0 != sK55
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_251]) ).
cnf(c_800,plain,
( ~ ssList(nil)
| ~ ssList(sK55)
| sK55 = nil ),
inference(unflattening,[status(thm)],[c_799]) ).
cnf(c_801,plain,
sK55 = nil,
inference(global_subsumption_just,[status(thm)],[c_800,c_256,c_141,c_800]) ).
cnf(c_817,plain,
( X0 != nil
| X0 != sK57
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_415,c_371]) ).
cnf(c_818,plain,
( nil != sK57
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_817]) ).
cnf(c_819,plain,
nil != sK57,
inference(global_subsumption_just,[status(thm)],[c_818,c_141,c_818]) ).
cnf(c_4115,plain,
nil != sK57,
inference(subtyping,[status(esa)],[c_819]) ).
cnf(c_4117,plain,
sK55 = nil,
inference(subtyping,[status(esa)],[c_801]) ).
cnf(c_4127,negated_conjecture,
segmentP(sK55,sK57),
inference(subtyping,[status(esa)],[c_375]) ).
cnf(c_4173,plain,
( ~ segmentP(nil,X0_13)
| ~ ssList(X0_13)
| X0_13 = nil ),
inference(subtyping,[status(esa)],[c_196]) ).
cnf(c_4984,plain,
segmentP(nil,sK57),
inference(demodulation,[status(thm)],[c_4127,c_4117]) ).
cnf(c_5788,plain,
( ~ ssList(sK57)
| nil = sK57 ),
inference(superposition,[status(thm)],[c_4984,c_4173]) ).
cnf(c_5793,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_5788,c_4115,c_249,c_252]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC206+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n009.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:18:40 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.43/1.13 % SZS status Started for theBenchmark.p
% 0.43/1.13 % SZS status Theorem for theBenchmark.p
% 0.43/1.13
% 0.43/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.43/1.13
% 0.43/1.13 ------ iProver source info
% 0.43/1.13
% 0.43/1.13 git: date: 2024-05-02 19:28:25 +0000
% 0.43/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.43/1.13 git: non_committed_changes: false
% 0.43/1.13
% 0.43/1.13 ------ Parsing...
% 0.43/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.43/1.13
% 0.43/1.13 ------ 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.43/1.13
% 0.43/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e scvd_s sp: 0 0s scvd_e snvd_s sp: 0 0s snvd_e
% 0.43/1.13
% 0.43/1.13 ------ Preprocessing...
% 0.43/1.13 ------ Proving...
% 0.43/1.13 ------ Problem Properties
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 clauses 190
% 0.43/1.13 conjectures 5
% 0.43/1.13 EPR 59
% 0.43/1.13 Horn 122
% 0.43/1.13 unary 26
% 0.43/1.13 binary 40
% 0.43/1.13 lits 628
% 0.43/1.13 lits eq 83
% 0.43/1.13 fd_pure 0
% 0.43/1.13 fd_pseudo 0
% 0.43/1.13 fd_cond 21
% 0.43/1.13 fd_pseudo_cond 14
% 0.43/1.13 AC symbols 0
% 0.43/1.13
% 0.43/1.13 ------ Input Options Time Limit: Unbounded
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 ------
% 0.43/1.13 Current options:
% 0.43/1.13 ------
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 ------ Proving...
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 % SZS status Theorem for theBenchmark.p
% 0.43/1.13
% 0.43/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.13
% 0.43/1.14
%------------------------------------------------------------------------------