TSTP Solution File: SWC294+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC294+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:54 EDT 2024
% Result : Theorem 4.27s 1.18s
% Output : CNFRefutation 4.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 72 ( 27 unt; 0 def)
% Number of atoms : 264 ( 68 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 287 ( 95 ~; 88 |; 82 &)
% ( 6 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 34 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
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(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax68) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ~ singletonP(X2) )
| strictorderedP(X0)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ~ singletonP(X2) )
| strictorderedP(X0)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f100,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
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(f182,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(X0)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f240,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f241,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f240]) ).
fof(f242,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK10(X0),nil) = X0
& ssItem(sK10(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f243,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ( cons(sK10(X0),nil) = X0
& ssItem(sK10(X0)) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f241,f242]) ).
fof(f315,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] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f176]) ).
fof(f342,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(X0)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(sK53)
& segmentP(X3,X2)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f343,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(sK53)
& segmentP(X3,X2)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(sK53)
& segmentP(X3,X2)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(X2) )
& ~ strictorderedP(sK53)
& segmentP(X3,X2)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(sK55) )
& ~ strictorderedP(sK53)
& segmentP(X3,sK55)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| singletonP(sK55) )
& ~ strictorderedP(sK53)
& segmentP(X3,sK55)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ~ neq(sK56,nil)
| singletonP(sK55) )
& ~ strictorderedP(sK53)
& segmentP(sK56,sK55)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ( ~ neq(sK56,nil)
| singletonP(sK55) )
& ~ strictorderedP(sK53)
& segmentP(sK56,sK55)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f221,f345,f344,f343,f342]) ).
fof(f356,plain,
! [X0] :
( ssItem(sK10(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f243]) ).
fof(f357,plain,
! [X0] :
( cons(sK10(X0),nil) = X0
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f243]) ).
fof(f437,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f315]) ).
fof(f439,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f493,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f329]) ).
fof(f508,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f509,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f546,plain,
ssList(sK53),
inference(cnf_transformation,[],[f346]) ).
fof(f547,plain,
ssList(sK54),
inference(cnf_transformation,[],[f346]) ).
fof(f550,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f346]) ).
fof(f551,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f346]) ).
fof(f552,plain,
segmentP(sK56,sK55),
inference(cnf_transformation,[],[f346]) ).
fof(f553,plain,
~ strictorderedP(sK53),
inference(cnf_transformation,[],[f346]) ).
fof(f554,plain,
( ~ neq(sK56,nil)
| singletonP(sK55) ),
inference(cnf_transformation,[],[f346]) ).
fof(f555,plain,
~ strictorderedP(sK55),
inference(definition_unfolding,[],[f553,f551]) ).
fof(f556,plain,
ssList(sK56),
inference(definition_unfolding,[],[f547,f550]) ).
fof(f557,plain,
ssList(sK55),
inference(definition_unfolding,[],[f546,f551]) ).
cnf(c_59,plain,
( ~ ssList(X0)
| ~ singletonP(X0)
| cons(sK10(X0),nil) = X0 ),
inference(cnf_transformation,[],[f357]) ).
cnf(c_60,plain,
( ~ ssList(X0)
| ~ singletonP(X0)
| ssItem(sK10(X0)) ),
inference(cnf_transformation,[],[f356]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f437]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f439]) ).
cnf(c_196,plain,
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f493]) ).
cnf(c_209,plain,
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f508]) ).
cnf(c_210,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f509]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| singletonP(sK55) ),
inference(cnf_transformation,[],[f554]) ).
cnf(c_247,negated_conjecture,
~ strictorderedP(sK55),
inference(cnf_transformation,[],[f555]) ).
cnf(c_248,negated_conjecture,
segmentP(sK56,sK55),
inference(cnf_transformation,[],[f552]) ).
cnf(c_251,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f556]) ).
cnf(c_252,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f557]) ).
cnf(c_3237,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| singletonP(sK55) ),
inference(resolution_lifted,[status(thm)],[c_138,c_246]) ).
cnf(c_3238,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = nil
| singletonP(sK55) ),
inference(unflattening,[status(thm)],[c_3237]) ).
cnf(c_3239,plain,
( sK56 = nil
| singletonP(sK55) ),
inference(global_subsumption_just,[status(thm)],[c_3238,c_251,c_141,c_3238]) ).
cnf(c_3283,plain,
( X0 != sK55
| ~ ssList(X0)
| nil = sK56
| ssItem(sK10(X0)) ),
inference(resolution_lifted,[status(thm)],[c_60,c_3239]) ).
cnf(c_3284,plain,
( ~ ssList(sK55)
| nil = sK56
| ssItem(sK10(sK55)) ),
inference(unflattening,[status(thm)],[c_3283]) ).
cnf(c_3285,plain,
( nil = sK56
| ssItem(sK10(sK55)) ),
inference(global_subsumption_just,[status(thm)],[c_3284,c_252,c_3284]) ).
cnf(c_8945,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_252]) ).
cnf(c_8947,negated_conjecture,
segmentP(sK56,sK55),
inference(demodulation,[status(thm)],[c_248]) ).
cnf(c_8948,negated_conjecture,
~ strictorderedP(sK55),
inference(demodulation,[status(thm)],[c_247]) ).
cnf(c_12673,plain,
( ~ ssList(sK55)
| cons(sK10(sK55),nil) = sK55
| nil = sK56 ),
inference(superposition,[status(thm)],[c_3239,c_59]) ).
cnf(c_12674,plain,
( cons(sK10(sK55),nil) = sK55
| nil = sK56 ),
inference(forward_subsumption_resolution,[status(thm)],[c_12673,c_8945]) ).
cnf(c_12694,plain,
( ~ ssItem(sK10(sK55))
| nil = sK56
| strictorderedP(sK55) ),
inference(superposition,[status(thm)],[c_12674,c_209]) ).
cnf(c_12702,plain,
( ~ ssItem(sK10(sK55))
| nil = sK56 ),
inference(forward_subsumption_resolution,[status(thm)],[c_12694,c_8948]) ).
cnf(c_12713,plain,
nil = sK56,
inference(global_subsumption_just,[status(thm)],[c_12702,c_3285,c_12702]) ).
cnf(c_12724,plain,
segmentP(nil,sK55),
inference(demodulation,[status(thm)],[c_8947,c_12713]) ).
cnf(c_12726,plain,
( ~ ssList(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_12724,c_196]) ).
cnf(c_12727,plain,
nil = sK55,
inference(forward_subsumption_resolution,[status(thm)],[c_12726,c_8945]) ).
cnf(c_12736,plain,
~ strictorderedP(nil),
inference(demodulation,[status(thm)],[c_8948,c_12727]) ).
cnf(c_12738,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12736,c_210]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC294+1 : TPTP v8.1.2. Released v2.4.0.
% 0.04/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 23:37:39 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.27/1.18 % SZS status Started for theBenchmark.p
% 4.27/1.18 % SZS status Theorem for theBenchmark.p
% 4.27/1.18
% 4.27/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.27/1.18
% 4.27/1.18 ------ iProver source info
% 4.27/1.18
% 4.27/1.18 git: date: 2024-05-02 19:28:25 +0000
% 4.27/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.27/1.18 git: non_committed_changes: false
% 4.27/1.18
% 4.27/1.18 ------ Parsing...
% 4.27/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.27/1.18
% 4.27/1.18 ------ 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.27/1.18
% 4.27/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.27/1.18
% 4.27/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.27/1.18 ------ Proving...
% 4.27/1.18 ------ Problem Properties
% 4.27/1.18
% 4.27/1.18
% 4.27/1.18 clauses 185
% 4.27/1.18 conjectures 4
% 4.27/1.18 EPR 54
% 4.27/1.18 Horn 116
% 4.27/1.18 unary 20
% 4.27/1.18 binary 41
% 4.27/1.18 lits 624
% 4.27/1.18 lits eq 79
% 4.27/1.18 fd_pure 0
% 4.27/1.18 fd_pseudo 0
% 4.27/1.18 fd_cond 21
% 4.27/1.18 fd_pseudo_cond 14
% 4.27/1.18 AC symbols 0
% 4.27/1.18
% 4.27/1.18 ------ Schedule dynamic 5 is on
% 4.27/1.18
% 4.27/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.27/1.18
% 4.27/1.18
% 4.27/1.18 ------
% 4.27/1.18 Current options:
% 4.27/1.18 ------
% 4.27/1.18
% 4.27/1.18
% 4.27/1.18
% 4.27/1.18
% 4.27/1.18 ------ Proving...
% 4.27/1.18
% 4.27/1.18
% 4.27/1.18 % SZS status Theorem for theBenchmark.p
% 4.27/1.18
% 4.27/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.27/1.18
% 4.27/1.18
%------------------------------------------------------------------------------