TSTP Solution File: SWC019+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC019+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:10:54 EDT 2024
% Result : Theorem 3.53s 0.97s
% Output : CNFRefutation 3.53s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f597)
% 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(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax42) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X0
& nil = X1 )
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X2 != X3
| 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)
=> ( ( nil = X0
& nil = X1 )
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X2 != X3
| 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(f153,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X2 = X3
& 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(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != sK53
| nil != X1 )
& ! [X4] :
( ~ frontsegP(sK53,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X2 = X3
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != sK53
| nil != X1 )
& ! [X4] :
( ~ frontsegP(sK53,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X2 = X3
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ frontsegP(sK53,X4)
| ~ frontsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X2 = X3
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ frontsegP(sK53,X4)
| ~ frontsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X2 = X3
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ frontsegP(sK53,X4)
| ~ frontsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK55 = X3
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ frontsegP(sK53,X4)
| ~ frontsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK55 = X3
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ frontsegP(sK53,X4)
| ~ frontsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK55 = sK56
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ frontsegP(sK53,X4)
| ~ frontsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK55 = sK56
& 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(f474,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f153]) ).
fof(f548,plain,
ssList(sK54),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f560,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
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_175,plain,
( ~ ssList(X0)
| frontsegP(X0,X0) ),
inference(cnf_transformation,[],[f474]) ).
cnf(c_246,negated_conjecture,
nil != sK56,
inference(cnf_transformation,[],[f596]) ).
cnf(c_247,negated_conjecture,
( ~ neq(X0,nil)
| ~ frontsegP(sK56,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f597]) ).
cnf(c_250,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f560]) ).
cnf(c_3203,plain,
( X0 != X1
| X2 != nil
| ~ frontsegP(sK56,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| X0 = X2 ),
inference(resolution_lifted,[status(thm)],[c_138,c_247]) ).
cnf(c_3204,plain,
( ~ frontsegP(sK56,X0)
| ~ ssList(X0)
| ~ ssList(nil)
| X0 = nil ),
inference(unflattening,[status(thm)],[c_3203]) ).
cnf(c_3206,plain,
( ~ ssList(X0)
| ~ frontsegP(sK56,X0)
| X0 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3204,c_141,c_3204]) ).
cnf(c_3207,plain,
( ~ frontsegP(sK56,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(renaming,[status(thm)],[c_3206]) ).
cnf(c_8812,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_250]) ).
cnf(c_8813,negated_conjecture,
nil != sK56,
inference(demodulation,[status(thm)],[c_246]) ).
cnf(c_11683,plain,
( ~ ssList(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_175,c_3207]) ).
cnf(c_11684,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11683,c_8813,c_8812]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SWC019+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.07 % Command : run_iprover %s %d THM
% 0.06/0.25 % Computer : n014.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Thu May 2 23:29:32 EDT 2024
% 0.06/0.25 % CPUTime :
% 0.10/0.32 Running first-order theorem proving
% 0.10/0.32 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.53/0.97 % SZS status Started for theBenchmark.p
% 3.53/0.97 % SZS status Theorem for theBenchmark.p
% 3.53/0.97
% 3.53/0.97 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.53/0.97
% 3.53/0.97 ------ iProver source info
% 3.53/0.97
% 3.53/0.97 git: date: 2024-05-02 19:28:25 +0000
% 3.53/0.97 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.53/0.97 git: non_committed_changes: false
% 3.53/0.97
% 3.53/0.97 ------ Parsing...
% 3.53/0.97 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.53/0.97
% 3.53/0.97 ------ 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.53/0.97
% 3.53/0.97 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.53/0.97
% 3.53/0.97 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.53/0.97 ------ Proving...
% 3.53/0.97 ------ Problem Properties
% 3.53/0.97
% 3.53/0.97
% 3.53/0.97 clauses 183
% 3.53/0.97 conjectures 2
% 3.53/0.97 EPR 52
% 3.53/0.97 Horn 115
% 3.53/0.97 unary 18
% 3.53/0.97 binary 40
% 3.53/0.97 lits 623
% 3.53/0.97 lits eq 80
% 3.53/0.97 fd_pure 0
% 3.53/0.97 fd_pseudo 0
% 3.53/0.97 fd_cond 22
% 3.53/0.97 fd_pseudo_cond 14
% 3.53/0.97 AC symbols 0
% 3.53/0.97
% 3.53/0.97 ------ Schedule dynamic 5 is on
% 3.53/0.97
% 3.53/0.97 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.53/0.97
% 3.53/0.97
% 3.53/0.97 ------
% 3.53/0.97 Current options:
% 3.53/0.97 ------
% 3.53/0.97
% 3.53/0.97
% 3.53/0.97
% 3.53/0.97
% 3.53/0.97 ------ Proving...
% 3.53/0.97
% 3.53/0.97
% 3.53/0.97 % SZS status Theorem for theBenchmark.p
% 3.53/0.97
% 3.53/0.97 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.53/0.97
% 3.53/0.97
%------------------------------------------------------------------------------