TSTP Solution File: SWC086+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC086+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 : Thu Aug 31 20:40:52 EDT 2023
% Result : Theorem 3.08s 1.03s
% Output : CNFRefutation 3.08s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f592)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/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) )
& ( nil != X2
| nil != X3 ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f172,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& 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) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& 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) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( segmentP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( segmentP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( segmentP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( segmentP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& 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(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f491,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f547,plain,
ssList(sK53),
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,
neq(sK54,nil),
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
( neq(sK55,nil)
| nil = sK56 ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
( segmentP(sK56,sK55)
| nil = sK56 ),
inference(cnf_transformation,[],[f347]) ).
fof(f559,plain,
! [X4] :
( ~ segmentP(sK55,X4)
| ~ segmentP(sK56,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f554,f552,f551]) ).
fof(f560,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f553,f551]) ).
fof(f562,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f592]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_192,plain,
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[],[f491]) ).
cnf(c_247,negated_conjecture,
( nil = sK56
| segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_249,negated_conjecture,
( nil = sK56
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_250,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_251,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f560]) ).
cnf(c_255,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f562]) ).
cnf(c_3285,plain,
( X0 != nil
| X0 != sK56
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_139,c_251]) ).
cnf(c_3286,plain,
( nil != sK56
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3285]) ).
cnf(c_3295,plain,
( X0 != sK55
| nil != nil
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0)
| nil = sK56 ),
inference(resolution_lifted,[status(thm)],[c_249,c_250]) ).
cnf(c_3296,plain,
( ~ segmentP(sK56,sK55)
| ~ segmentP(sK55,sK55)
| ~ ssList(sK55)
| nil = sK56 ),
inference(unflattening,[status(thm)],[c_3295]) ).
cnf(c_3297,plain,
~ segmentP(sK55,sK55),
inference(global_subsumption_just,[status(thm)],[c_3296,c_255,c_141,c_247,c_3286,c_3296]) ).
cnf(c_11857,plain,
~ ssList(sK55),
inference(superposition,[status(thm)],[c_192,c_3297]) ).
cnf(c_11859,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11857,c_255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC086+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Aug 28 16:08:31 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.40 Running first-order theorem proving
% 0.16/0.40 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.08/1.03 % SZS status Started for theBenchmark.p
% 3.08/1.03 % SZS status Theorem for theBenchmark.p
% 3.08/1.03
% 3.08/1.03 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.08/1.03
% 3.08/1.03 ------ iProver source info
% 3.08/1.03
% 3.08/1.03 git: date: 2023-05-31 18:12:56 +0000
% 3.08/1.03 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.08/1.03 git: non_committed_changes: false
% 3.08/1.03 git: last_make_outside_of_git: false
% 3.08/1.03
% 3.08/1.03 ------ Parsing...
% 3.08/1.03 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.08/1.03
% 3.08/1.03 ------ 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
% 3.08/1.03
% 3.08/1.03 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.08/1.03
% 3.08/1.03 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.08/1.03 ------ Proving...
% 3.08/1.03 ------ Problem Properties
% 3.08/1.03
% 3.08/1.03
% 3.08/1.03 clauses 188
% 3.08/1.03 conjectures 2
% 3.08/1.03 EPR 57
% 3.08/1.03 Horn 120
% 3.08/1.03 unary 22
% 3.08/1.03 binary 41
% 3.08/1.03 lits 630
% 3.08/1.03 lits eq 81
% 3.08/1.03 fd_pure 0
% 3.08/1.03 fd_pseudo 0
% 3.08/1.03 fd_cond 22
% 3.08/1.03 fd_pseudo_cond 14
% 3.08/1.03 AC symbols 0
% 3.08/1.03
% 3.08/1.03 ------ Schedule dynamic 5 is on
% 3.08/1.03
% 3.08/1.03 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.08/1.03
% 3.08/1.03
% 3.08/1.03 ------
% 3.08/1.03 Current options:
% 3.08/1.03 ------
% 3.08/1.03
% 3.08/1.03
% 3.08/1.03
% 3.08/1.03
% 3.08/1.03 ------ Proving...
% 3.08/1.03
% 3.08/1.03
% 3.08/1.03 % SZS status Theorem for theBenchmark.p
% 3.08/1.03
% 3.08/1.03 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.08/1.03
% 3.08/1.03
%------------------------------------------------------------------------------