TSTP Solution File: SWC328+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC328+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:01 EDT 2024
% Result : Theorem 3.93s 1.09s
% Output : CNFRefutation 3.93s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f648)
% Comments :
%------------------------------------------------------------------------------
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).
fof(f74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax74) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f175,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK53)
| ~ segmentP(X1,sK53) )
& sK53 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK53)
| ~ segmentP(X1,sK53) )
& sK53 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = X2
& sK54 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = X2
& sK54 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = sK55
& sK54 = X3
& nil = sK55
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = sK55
& sK54 = X3
& nil = sK55
& ssList(X3) )
=> ( ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = sK55
& sK54 = sK56
& nil = sK55
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = sK55
& sK54 = sK56
& nil = sK55
& 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(f493,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f519,plain,
equalelemsP(nil),
inference(cnf_transformation,[],[f74]) ).
fof(f533,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f547,plain,
ssList(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f548,plain,
ssList(sK54),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
nil = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) ),
inference(cnf_transformation,[],[f347]) ).
fof(f573,plain,
! [X0] :
( segmentP(X0,sK55)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f493,f551]) ).
fof(f599,plain,
equalelemsP(sK55),
inference(definition_unfolding,[],[f519,f551]) ).
fof(f610,plain,
! [X0] :
( app(X0,sK55) = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f533,f551]) ).
fof(f613,plain,
( ~ equalelemsP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(definition_unfolding,[],[f554,f553,f552,f553]) ).
fof(f614,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f552]) ).
fof(f615,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f553]) ).
cnf(c_194,negated_conjecture,
( ~ ssList(X0)
| segmentP(X0,sK55) ),
inference(cnf_transformation,[],[f573]) ).
cnf(c_218,negated_conjecture,
equalelemsP(sK55),
inference(cnf_transformation,[],[f599]) ).
cnf(c_229,negated_conjecture,
( ~ ssList(sK55)
| app(sK55,sK55) = sK55 ),
inference(cnf_transformation,[],[f648]) ).
cnf(c_232,negated_conjecture,
( ~ ssList(X0)
| app(X0,sK55) = X0 ),
inference(cnf_transformation,[],[f610]) ).
cnf(c_246,negated_conjecture,
( ~ segmentP(sK56,sK55)
| ~ equalelemsP(sK55) ),
inference(cnf_transformation,[],[f613]) ).
cnf(c_249,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f614]) ).
cnf(c_250,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f615]) ).
cnf(c_291,plain,
( ~ ssList(sK55)
| app(sK55,sK55) = sK55 ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_363,negated_conjecture,
~ segmentP(sK56,sK55),
inference(global_subsumption_just,[status(thm)],[c_246,c_218,c_246]) ).
cnf(c_365,negated_conjecture,
app(sK55,sK55) = sK55,
inference(global_subsumption_just,[status(thm)],[c_229,c_250,c_291]) ).
cnf(c_8766,plain,
app(sK55,sK55) = sP0_iProver_def,
definition ).
cnf(c_8767,negated_conjecture,
sP0_iProver_def = sK55,
inference(demodulation,[status(thm)],[c_365,c_8766]) ).
cnf(c_8768,negated_conjecture,
~ segmentP(sK56,sK55),
inference(demodulation,[status(thm)],[c_363]) ).
cnf(c_8772,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_249]) ).
cnf(c_8800,negated_conjecture,
( ~ ssList(X0)
| segmentP(X0,sK55) ),
inference(demodulation,[status(thm)],[c_194]) ).
cnf(c_11613,plain,
~ segmentP(sK56,sP0_iProver_def),
inference(light_normalisation,[status(thm)],[c_8768,c_8767]) ).
cnf(c_11614,plain,
( ~ ssList(X0)
| segmentP(X0,sP0_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_8800,c_8767]) ).
cnf(c_11617,plain,
~ ssList(sK56),
inference(superposition,[status(thm)],[c_11614,c_11613]) ).
cnf(c_11618,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11617,c_8772]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC328+1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.10 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n003.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 23:35:35 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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
% 3.93/1.09 % SZS status Started for theBenchmark.p
% 3.93/1.09 % SZS status Theorem for theBenchmark.p
% 3.93/1.09
% 3.93/1.09 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.93/1.09
% 3.93/1.09 ------ iProver source info
% 3.93/1.09
% 3.93/1.09 git: date: 2024-05-02 19:28:25 +0000
% 3.93/1.09 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.93/1.09 git: non_committed_changes: false
% 3.93/1.09
% 3.93/1.09 ------ Parsing...
% 3.93/1.09 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.93/1.09
% 3.93/1.09 ------ 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.93/1.09
% 3.93/1.09 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.93/1.09
% 3.93/1.09 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.93/1.09 ------ Proving...
% 3.93/1.09 ------ Problem Properties
% 3.93/1.09
% 3.93/1.09
% 3.93/1.09 clauses 183
% 3.93/1.09 conjectures 50
% 3.93/1.09 EPR 52
% 3.93/1.09 Horn 115
% 3.93/1.09 unary 19
% 3.93/1.09 binary 40
% 3.93/1.09 lits 621
% 3.93/1.09 lits eq 79
% 3.93/1.09 fd_pure 0
% 3.93/1.09 fd_pseudo 0
% 3.93/1.09 fd_cond 21
% 3.93/1.09 fd_pseudo_cond 14
% 3.93/1.09 AC symbols 0
% 3.93/1.09
% 3.93/1.09 ------ Schedule dynamic 5 is on
% 3.93/1.09
% 3.93/1.09 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.93/1.09
% 3.93/1.09
% 3.93/1.09 ------
% 3.93/1.09 Current options:
% 3.93/1.09 ------
% 3.93/1.09
% 3.93/1.09
% 3.93/1.09
% 3.93/1.09
% 3.93/1.09 ------ Proving...
% 3.93/1.09
% 3.93/1.09
% 3.93/1.09 % SZS status Theorem for theBenchmark.p
% 3.93/1.09
% 3.93/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.93/1.10
% 3.93/1.10
%------------------------------------------------------------------------------