TSTP Solution File: SWC044+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC044+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:00 EDT 2024
% Result : Theorem 3.79s 1.18s
% Output : CNFRefutation 3.79s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f650)
% Comments :
%------------------------------------------------------------------------------
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax52) ).
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 = X0
| ~ rearsegP(X3,X2)
| 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 = X0
| ~ rearsegP(X3,X2)
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f167,plain,
! [X0] :
( ( rearsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil != X0
& rearsegP(X3,X2)
& 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 != X0
& rearsegP(X3,X2)
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f329,plain,
! [X0] :
( ( ( rearsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ rearsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f167]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil != X0
& rearsegP(X3,X2)
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil != sK53
& rearsegP(X3,X2)
& sK53 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil != sK53
& rearsegP(X3,X2)
& sK53 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( nil != sK53
& rearsegP(X3,X2)
& sK53 = X2
& sK54 = X3
& nil = sK54
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( nil != sK53
& rearsegP(X3,X2)
& sK53 = X2
& sK54 = X3
& nil = sK54
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( nil != sK53
& rearsegP(X3,sK55)
& sK53 = sK55
& sK54 = X3
& nil = sK54
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( nil != sK53
& rearsegP(X3,sK55)
& sK53 = sK55
& sK54 = X3
& nil = sK54
& ssList(X3) )
=> ( nil != sK53
& rearsegP(sK56,sK55)
& sK53 = sK55
& sK54 = sK56
& nil = sK54
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( nil != sK53
& rearsegP(sK56,sK55)
& 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])],[f222,f346,f345,f344,f343]) ).
fof(f487,plain,
! [X0] :
( nil = X0
| ~ rearsegP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f329]) ).
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 = sK54,
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,
rearsegP(sK56,sK55),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
nil != sK53,
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
nil = sK56,
inference(definition_unfolding,[],[f551,f552]) ).
fof(f574,plain,
! [X0] :
( sK56 = X0
| ~ rearsegP(sK56,X0)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f487,f556,f556]) ).
fof(f612,plain,
! [X0] :
( app(X0,sK56) = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f533,f556]) ).
fof(f615,plain,
sK55 != sK56,
inference(definition_unfolding,[],[f555,f556,f553]) ).
fof(f616,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f552]) ).
fof(f617,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f553]) ).
cnf(c_189,negated_conjecture,
( ~ rearsegP(sK56,X0)
| ~ ssList(X0)
| X0 = sK56 ),
inference(cnf_transformation,[],[f574]) ).
cnf(c_229,negated_conjecture,
( ~ ssList(sK56)
| app(sK56,sK56) = sK56 ),
inference(cnf_transformation,[],[f650]) ).
cnf(c_232,negated_conjecture,
( ~ ssList(X0)
| app(X0,sK56) = X0 ),
inference(cnf_transformation,[],[f612]) ).
cnf(c_246,negated_conjecture,
sK56 != sK55,
inference(cnf_transformation,[],[f615]) ).
cnf(c_247,negated_conjecture,
rearsegP(sK56,sK55),
inference(cnf_transformation,[],[f554]) ).
cnf(c_250,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f616]) ).
cnf(c_251,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f617]) ).
cnf(c_292,plain,
( ~ ssList(sK56)
| app(sK56,sK56) = sK56 ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_364,negated_conjecture,
app(sK56,sK56) = sK56,
inference(global_subsumption_just,[status(thm)],[c_229,c_250,c_292]) ).
cnf(c_8769,plain,
app(sK56,sK56) = sP0_iProver_def,
definition ).
cnf(c_8770,negated_conjecture,
sP0_iProver_def = sK56,
inference(demodulation,[status(thm)],[c_364,c_8769]) ).
cnf(c_8774,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_251]) ).
cnf(c_8775,negated_conjecture,
rearsegP(sK56,sK55),
inference(demodulation,[status(thm)],[c_247]) ).
cnf(c_8776,negated_conjecture,
sK56 != sK55,
inference(demodulation,[status(thm)],[c_246]) ).
cnf(c_8805,negated_conjecture,
( ~ rearsegP(sK56,X0)
| ~ ssList(X0)
| X0 = sK56 ),
inference(demodulation,[status(thm)],[c_189]) ).
cnf(c_11617,plain,
rearsegP(sP0_iProver_def,sK55),
inference(light_normalisation,[status(thm)],[c_8775,c_8770]) ).
cnf(c_11622,plain,
sK55 != sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_8776,c_8770]) ).
cnf(c_11875,plain,
( ~ rearsegP(sP0_iProver_def,X0)
| ~ ssList(X0)
| X0 = sP0_iProver_def ),
inference(light_normalisation,[status(thm)],[c_8805,c_8770]) ).
cnf(c_11883,plain,
( ~ ssList(sK55)
| sK55 = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_11617,c_11875]) ).
cnf(c_11885,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11883,c_11622,c_8774]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC044+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 23:41:24 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/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
% 3.79/1.18 % SZS status Started for theBenchmark.p
% 3.79/1.18 % SZS status Theorem for theBenchmark.p
% 3.79/1.18
% 3.79/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.79/1.18
% 3.79/1.18 ------ iProver source info
% 3.79/1.18
% 3.79/1.18 git: date: 2024-05-02 19:28:25 +0000
% 3.79/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.79/1.18 git: non_committed_changes: false
% 3.79/1.18
% 3.79/1.18 ------ Parsing...
% 3.79/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.79/1.18
% 3.79/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: 4 0s sf_e pe_s pe_e
% 3.79/1.18
% 3.79/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.79/1.18
% 3.79/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.79/1.18 ------ Proving...
% 3.79/1.18 ------ Problem Properties
% 3.79/1.18
% 3.79/1.18
% 3.79/1.18 clauses 184
% 3.79/1.18 conjectures 51
% 3.79/1.18 EPR 53
% 3.79/1.18 Horn 116
% 3.79/1.18 unary 20
% 3.79/1.18 binary 40
% 3.79/1.18 lits 622
% 3.79/1.18 lits eq 80
% 3.79/1.18 fd_pure 0
% 3.79/1.18 fd_pseudo 0
% 3.79/1.18 fd_cond 21
% 3.79/1.18 fd_pseudo_cond 14
% 3.79/1.18 AC symbols 0
% 3.79/1.18
% 3.79/1.18 ------ Schedule dynamic 5 is on
% 3.79/1.18
% 3.79/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.79/1.18
% 3.79/1.18
% 3.79/1.18 ------
% 3.79/1.18 Current options:
% 3.79/1.18 ------
% 3.79/1.18
% 3.79/1.18
% 3.79/1.18
% 3.79/1.18
% 3.79/1.18 ------ Proving...
% 3.79/1.18
% 3.79/1.18
% 3.79/1.18 % SZS status Theorem for theBenchmark.p
% 3.79/1.18
% 3.79/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.79/1.18
% 3.79/1.18
%------------------------------------------------------------------------------