TSTP Solution File: SWC037+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC037+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:10:58 EDT 2024
% Result : Theorem 4.20s 1.20s
% Output : CNFRefutation 4.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f666)
% Comments :
%------------------------------------------------------------------------------
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f176,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
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] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK53
& sK53 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK53
& sK53 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& nil = sK54
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& nil = sK54
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK55
& nil = X3 )
| ? [X4] :
( segmentP(sK55,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& nil = sK54
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( nil = sK55
& nil = X3 )
| ? [X4] :
( segmentP(sK55,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& nil = sK54
& ssList(X3) )
=> ( ( ( nil = sK55
& nil = sK56 )
| ? [X4] :
( segmentP(sK55,X4)
& segmentP(sK56,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& nil = sK54
& 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,
( ( ( nil = sK55
& nil = sK56 )
| ( segmentP(sK55,sK57)
& segmentP(sK56,sK57)
& neq(sK57,nil)
& ssList(sK57) ) )
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& nil = sK54
& 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(f495,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
fof(f534,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f549,plain,
ssList(sK54),
inference(cnf_transformation,[],[f348]) ).
fof(f552,plain,
nil = sK54,
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f554,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f555,plain,
nil != sK53,
inference(cnf_transformation,[],[f348]) ).
fof(f560,plain,
( nil = sK55
| ssList(sK57) ),
inference(cnf_transformation,[],[f348]) ).
fof(f561,plain,
( nil = sK55
| neq(sK57,nil) ),
inference(cnf_transformation,[],[f348]) ).
fof(f562,plain,
( nil = sK55
| segmentP(sK56,sK57) ),
inference(cnf_transformation,[],[f348]) ).
fof(f564,plain,
nil = sK56,
inference(definition_unfolding,[],[f552,f553]) ).
fof(f585,plain,
! [X0] :
( sK56 = X0
| ~ segmentP(sK56,X0)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f495,f564,f564]) ).
fof(f620,plain,
! [X0] :
( app(X0,sK56) = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f534,f564]) ).
fof(f624,plain,
( sK55 = sK56
| segmentP(sK56,sK57) ),
inference(definition_unfolding,[],[f562,f564]) ).
fof(f625,plain,
( sK55 = sK56
| neq(sK57,sK56) ),
inference(definition_unfolding,[],[f561,f564,f564]) ).
fof(f626,plain,
( sK55 = sK56
| ssList(sK57) ),
inference(definition_unfolding,[],[f560,f564]) ).
fof(f631,plain,
sK55 != sK56,
inference(definition_unfolding,[],[f555,f564,f554]) ).
fof(f632,plain,
ssList(sK56),
inference(definition_unfolding,[],[f549,f553]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f663]) ).
cnf(c_196,negated_conjecture,
( ~ segmentP(sK56,X0)
| ~ ssList(X0)
| X0 = sK56 ),
inference(cnf_transformation,[],[f585]) ).
cnf(c_229,negated_conjecture,
( ~ ssList(sK56)
| app(sK56,sK56) = sK56 ),
inference(cnf_transformation,[],[f666]) ).
cnf(c_232,negated_conjecture,
( ~ ssList(X0)
| app(X0,sK56) = X0 ),
inference(cnf_transformation,[],[f620]) ).
cnf(c_247,negated_conjecture,
( sK56 = sK55
| segmentP(sK56,sK57) ),
inference(cnf_transformation,[],[f624]) ).
cnf(c_248,negated_conjecture,
( sK56 = sK55
| neq(sK57,sK56) ),
inference(cnf_transformation,[],[f625]) ).
cnf(c_249,negated_conjecture,
( sK56 = sK55
| ssList(sK57) ),
inference(cnf_transformation,[],[f626]) ).
cnf(c_250,negated_conjecture,
sK56 != sK55,
inference(cnf_transformation,[],[f631]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f632]) ).
cnf(c_295,plain,
( ~ ssList(sK56)
| app(sK56,sK56) = sK56 ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_361,negated_conjecture,
ssList(sK57),
inference(global_subsumption_just,[status(thm)],[c_249,c_250,c_249]) ).
cnf(c_369,negated_conjecture,
neq(sK57,sK56),
inference(global_subsumption_just,[status(thm)],[c_248,c_250,c_248]) ).
cnf(c_371,negated_conjecture,
segmentP(sK56,sK57),
inference(global_subsumption_just,[status(thm)],[c_247,c_250,c_247]) ).
cnf(c_375,negated_conjecture,
app(sK56,sK56) = sK56,
inference(global_subsumption_just,[status(thm)],[c_229,c_253,c_295]) ).
cnf(c_3210,plain,
( X0 != sK56
| X0 != sK57
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_139,c_369]) ).
cnf(c_3211,plain,
( sK56 != sK57
| ~ ssList(sK56) ),
inference(unflattening,[status(thm)],[c_3210]) ).
cnf(c_3212,plain,
sK56 != sK57,
inference(global_subsumption_just,[status(thm)],[c_3211,c_253,c_3211]) ).
cnf(c_8803,plain,
app(sK56,sK56) = sP0_iProver_def,
definition ).
cnf(c_8804,negated_conjecture,
sP0_iProver_def = sK56,
inference(demodulation,[status(thm)],[c_375,c_8803]) ).
cnf(c_8806,negated_conjecture,
segmentP(sK56,sK57),
inference(demodulation,[status(thm)],[c_371]) ).
cnf(c_8810,negated_conjecture,
ssList(sK57),
inference(demodulation,[status(thm)],[c_361]) ).
cnf(c_8839,negated_conjecture,
( ~ segmentP(sK56,X0)
| ~ ssList(X0)
| X0 = sK56 ),
inference(demodulation,[status(thm)],[c_196]) ).
cnf(c_11661,plain,
sK57 != sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_3212,c_8804]) ).
cnf(c_11662,plain,
segmentP(sP0_iProver_def,sK57),
inference(light_normalisation,[status(thm)],[c_8806,c_8804]) ).
cnf(c_11912,plain,
( ~ segmentP(sP0_iProver_def,X0)
| ~ ssList(X0)
| X0 = sP0_iProver_def ),
inference(light_normalisation,[status(thm)],[c_8839,c_8804]) ).
cnf(c_11919,plain,
( ~ ssList(sK57)
| sK57 = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_11662,c_11912]) ).
cnf(c_11922,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11919,c_11661,c_8810]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC037+1 : TPTP v8.1.2. Released v2.4.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 23:41:18 EDT 2024
% 0.14/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.20/1.20 % SZS status Started for theBenchmark.p
% 4.20/1.20 % SZS status Theorem for theBenchmark.p
% 4.20/1.20
% 4.20/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.20/1.20
% 4.20/1.20 ------ iProver source info
% 4.20/1.20
% 4.20/1.20 git: date: 2024-05-02 19:28:25 +0000
% 4.20/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.20/1.20 git: non_committed_changes: false
% 4.20/1.20
% 4.20/1.20 ------ Parsing...
% 4.20/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.20/1.20
% 4.20/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.20/1.20
% 4.20/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.20/1.20
% 4.20/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.20/1.20 ------ Proving...
% 4.20/1.20 ------ Problem Properties
% 4.20/1.20
% 4.20/1.20
% 4.20/1.20 clauses 187
% 4.20/1.20 conjectures 53
% 4.20/1.20 EPR 56
% 4.20/1.20 Horn 119
% 4.20/1.20 unary 23
% 4.20/1.20 binary 40
% 4.20/1.20 lits 625
% 4.20/1.20 lits eq 81
% 4.20/1.20 fd_pure 0
% 4.20/1.20 fd_pseudo 0
% 4.20/1.20 fd_cond 21
% 4.20/1.20 fd_pseudo_cond 14
% 4.20/1.20 AC symbols 0
% 4.20/1.20
% 4.20/1.20 ------ Schedule dynamic 5 is on
% 4.20/1.20
% 4.20/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.20/1.20
% 4.20/1.20
% 4.20/1.20 ------
% 4.20/1.20 Current options:
% 4.20/1.20 ------
% 4.20/1.20
% 4.20/1.20
% 4.20/1.20
% 4.20/1.20
% 4.20/1.20 ------ Proving...
% 4.20/1.20
% 4.20/1.20
% 4.20/1.20 % SZS status Theorem for theBenchmark.p
% 4.20/1.20
% 4.20/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.20/1.20
% 4.20/1.21
%------------------------------------------------------------------------------