TSTP Solution File: SWC293+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC293+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:54 EDT 2024
% Result : Theorem 4.00s 1.20s
% Output : CNFRefutation 4.00s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax68) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f182,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ strictorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f342,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ strictorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ strictorderedP(sK53)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f343,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ strictorderedP(sK53)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ strictorderedP(sK53)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ strictorderedP(sK53)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK55
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ~ strictorderedP(sK53)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X3] :
( ( ( nil = sK55
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ~ strictorderedP(sK53)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( nil = sK55
& nil = sK56 )
| ? [X4] :
( memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) ) )
& ~ strictorderedP(sK53)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X4] :
( memberP(sK56,X4)
& cons(X4,nil) = sK55
& ssItem(X4) )
=> ( memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( nil = sK55
& nil = sK56 )
| ( memberP(sK56,sK57)
& sK55 = cons(sK57,nil)
& ssItem(sK57) ) )
& ~ strictorderedP(sK53)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f221,f346,f345,f344,f343,f342]) ).
fof(f509,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f510,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
~ strictorderedP(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
( nil = sK55
| ssItem(sK57) ),
inference(cnf_transformation,[],[f347]) ).
fof(f558,plain,
( nil = sK55
| sK55 = cons(sK57,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f560,plain,
~ strictorderedP(sK55),
inference(definition_unfolding,[],[f553,f552]) ).
cnf(c_209,plain,
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f509]) ).
cnf(c_210,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f510]) ).
cnf(c_247,negated_conjecture,
( cons(sK57,nil) = sK55
| nil = sK55 ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_248,negated_conjecture,
( nil = sK55
| ssItem(sK57) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_252,negated_conjecture,
~ strictorderedP(sK55),
inference(cnf_transformation,[],[f560]) ).
cnf(c_8870,plain,
cons(sK57,nil) = sP0_iProver_def,
definition ).
cnf(c_8873,negated_conjecture,
~ strictorderedP(sK55),
inference(demodulation,[status(thm)],[c_252]) ).
cnf(c_8877,negated_conjecture,
( nil = sK55
| ssItem(sK57) ),
inference(demodulation,[status(thm)],[c_248]) ).
cnf(c_8878,negated_conjecture,
( nil = sK55
| sP0_iProver_def = sK55 ),
inference(demodulation,[status(thm)],[c_247]) ).
cnf(c_11750,plain,
( ~ strictorderedP(nil)
| sK55 = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_8878,c_8873]) ).
cnf(c_11752,plain,
sK55 = sP0_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_11750,c_210]) ).
cnf(c_11756,plain,
( nil = sP0_iProver_def
| ssItem(sK57) ),
inference(demodulation,[status(thm)],[c_8877,c_11752]) ).
cnf(c_11757,plain,
~ strictorderedP(sP0_iProver_def),
inference(demodulation,[status(thm)],[c_8873,c_11752]) ).
cnf(c_11916,plain,
( ~ ssItem(sK57)
| strictorderedP(sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_8870,c_209]) ).
cnf(c_11917,plain,
~ ssItem(sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_11916,c_11757]) ).
cnf(c_11918,plain,
nil = sP0_iProver_def,
inference(backward_subsumption_resolution,[status(thm)],[c_11756,c_11917]) ).
cnf(c_11936,plain,
strictorderedP(sP0_iProver_def),
inference(demodulation,[status(thm)],[c_210,c_11918]) ).
cnf(c_11943,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11936,c_11757]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC293+1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 23:57:51 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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
% 4.00/1.20 % SZS status Started for theBenchmark.p
% 4.00/1.20 % SZS status Theorem for theBenchmark.p
% 4.00/1.20
% 4.00/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.00/1.20
% 4.00/1.20 ------ iProver source info
% 4.00/1.20
% 4.00/1.20 git: date: 2024-05-02 19:28:25 +0000
% 4.00/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.00/1.20 git: non_committed_changes: false
% 4.00/1.20
% 4.00/1.20 ------ Parsing...
% 4.00/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.00/1.20
% 4.00/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: 4 0s sf_e pe_s pe_e
% 4.00/1.20
% 4.00/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.00/1.20
% 4.00/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.00/1.20 ------ Proving...
% 4.00/1.20 ------ Problem Properties
% 4.00/1.20
% 4.00/1.20
% 4.00/1.20 clauses 190
% 4.00/1.20 conjectures 9
% 4.00/1.20 EPR 58
% 4.00/1.20 Horn 116
% 4.00/1.20 unary 20
% 4.00/1.20 binary 46
% 4.00/1.20 lits 634
% 4.00/1.20 lits eq 87
% 4.00/1.20 fd_pure 0
% 4.00/1.20 fd_pseudo 0
% 4.00/1.20 fd_cond 21
% 4.00/1.20 fd_pseudo_cond 14
% 4.00/1.20 AC symbols 0
% 4.00/1.20
% 4.00/1.20 ------ Schedule dynamic 5 is on
% 4.00/1.20
% 4.00/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.00/1.20
% 4.00/1.20
% 4.00/1.20 ------
% 4.00/1.20 Current options:
% 4.00/1.20 ------
% 4.00/1.20
% 4.00/1.20
% 4.00/1.20
% 4.00/1.20
% 4.00/1.20 ------ Proving...
% 4.00/1.20
% 4.00/1.20
% 4.00/1.20 % SZS status Theorem for theBenchmark.p
% 4.00/1.20
% 4.00/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.00/1.20
% 4.00/1.20
%------------------------------------------------------------------------------