TSTP Solution File: SWC369+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC369+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:12:12 EDT 2024
% Result : Theorem 2.86s 1.14s
% Output : CNFRefutation 2.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 18 unt; 0 def)
% Number of atoms : 220 ( 77 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 256 ( 81 ~; 63 |; 93 &)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 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 : 48 ( 0 sgn 20 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| segmentP(X1,X0)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| segmentP(X1,X0)
| 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] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ segmentP(X1,X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ segmentP(X1,X0)
& 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] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ segmentP(X1,X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ segmentP(X1,sK53)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ segmentP(X1,sK53)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ segmentP(sK54,sK53)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ~ segmentP(sK54,sK53)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( segmentP(X3,sK55)
& neq(sK55,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = sK55 )
& ~ segmentP(sK54,sK53)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( segmentP(X3,sK55)
& neq(sK55,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = sK55 )
& ~ segmentP(sK54,sK53)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( segmentP(sK56,sK55)
& neq(sK55,nil) )
| ~ neq(sK56,nil) )
& ( nil != sK56
| nil = sK55 )
& ~ segmentP(sK54,sK53)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( segmentP(sK56,sK55)
& neq(sK55,nil) )
| ~ neq(sK56,nil) )
& ( nil != sK56
| nil = sK55 )
& ~ segmentP(sK54,sK53)
& 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(f495,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
fof(f548,plain,
ssList(sK54),
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,
~ segmentP(sK54,sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
( segmentP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
~ segmentP(sK56,sK55),
inference(definition_unfolding,[],[f553,f551,f552]) ).
fof(f558,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
fof(f579,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f495]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f438]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_195,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(cnf_transformation,[],[f579]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_248,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f554]) ).
cnf(c_249,negated_conjecture,
~ segmentP(sK56,sK55),
inference(cnf_transformation,[],[f557]) ).
cnf(c_252,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f558]) ).
cnf(c_360,plain,
segmentP(nil,nil),
inference(global_subsumption_just,[status(thm)],[c_195,c_141,c_195]) ).
cnf(c_368,negated_conjecture,
~ neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_246,c_249,c_246]) ).
cnf(c_3209,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_368]) ).
cnf(c_3210,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = nil ),
inference(unflattening,[status(thm)],[c_3209]) ).
cnf(c_3211,plain,
sK56 = nil,
inference(global_subsumption_just,[status(thm)],[c_3210,c_252,c_141,c_3210]) ).
cnf(c_6021,plain,
~ segmentP(nil,sK55),
inference(light_normalisation,[status(thm)],[c_249,c_3211]) ).
cnf(c_6274,plain,
( nil != nil
| nil = sK55 ),
inference(demodulation,[status(thm)],[c_248,c_3211]) ).
cnf(c_6275,plain,
nil = sK55,
inference(equality_resolution_simp,[status(thm)],[c_6274]) ).
cnf(c_6276,plain,
~ segmentP(nil,nil),
inference(demodulation,[status(thm)],[c_6021,c_6275]) ).
cnf(c_6278,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6276,c_360]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SWC369+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.12 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n014.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu May 2 23:27:47 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.86/1.14 % SZS status Started for theBenchmark.p
% 2.86/1.14 % SZS status Theorem for theBenchmark.p
% 2.86/1.14
% 2.86/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.86/1.14
% 2.86/1.14 ------ iProver source info
% 2.86/1.14
% 2.86/1.14 git: date: 2024-05-02 19:28:25 +0000
% 2.86/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.86/1.14 git: non_committed_changes: false
% 2.86/1.14
% 2.86/1.14 ------ Parsing...
% 2.86/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.86/1.14
% 2.86/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e
% 2.86/1.14
% 2.86/1.14 % SZS status Theorem for theBenchmark.p
% 2.86/1.14
% 2.86/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.86/1.14
% 2.86/1.14
%------------------------------------------------------------------------------