TSTP Solution File: SWC288+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC288+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 : Thu Aug 31 20:42:17 EDT 2023
% Result : Theorem 7.29s 1.67s
% Output : CNFRefutation 7.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 43 ( 10 unt; 0 def)
% Number of atoms : 323 ( 102 equ)
% Maximal formula atoms : 22 ( 7 avg)
% Number of connectives : 404 ( 124 ~; 106 |; 151 &)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 124 ( 0 sgn; 64 !; 51 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax68) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X7] :
( lt(X7,X4)
& memberP(X6,X7)
& ssItem(X7) )
| ? [X8] :
( lt(X4,X8)
& memberP(X5,X8)
& ssItem(X8) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f183,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) )
& ~ strictorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f232,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP6(X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f233,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP6(X3,X2) )
& ~ strictorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f222,f232]) ).
fof(f345,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP6(X3,X2) ),
inference(nnf_transformation,[],[f232]) ).
fof(f346,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
| ~ sP6(X0,X1) ),
inference(rectify,[],[f345]) ).
fof(f347,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
=> ( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK54(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK54(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK54(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(sK54(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
! [X0,X1] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK54(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK54(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK54(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
=> ( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK54(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK54(X0,X1),X6)
| ~ memberP(sK55(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK55(X0,X1),X1),X4) = X0
& cons(sK54(X0,X1),nil) = X1
& ssList(X4) )
& ssList(sK55(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
! [X0,X1] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK54(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK54(X0,X1),X6)
| ~ memberP(sK55(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK55(X0,X1),X1),X4) = X0
& cons(sK54(X0,X1),nil) = X1
& ssList(X4) )
=> ( ! [X5] :
( ~ lt(X5,sK54(X0,X1))
| ~ memberP(sK56(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK54(X0,X1),X6)
| ~ memberP(sK55(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK55(X0,X1),X1),sK56(X0,X1)) = X0
& cons(sK54(X0,X1),nil) = X1
& ssList(sK56(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
! [X0,X1] :
( ( ! [X5] :
( ~ lt(X5,sK54(X0,X1))
| ~ memberP(sK56(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK54(X0,X1),X6)
| ~ memberP(sK55(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK55(X0,X1),X1),sK56(X0,X1)) = X0
& cons(sK54(X0,X1),nil) = X1
& ssList(sK56(X0,X1))
& ssList(sK55(X0,X1))
& ssItem(sK54(X0,X1)) )
| ~ sP6(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK54,sK55,sK56])],[f346,f349,f348,f347]) ).
fof(f351,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP6(X3,X2) )
& ~ strictorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP6(X3,X2) )
& ~ strictorderedP(sK57)
& sK57 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f352,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP6(X3,X2) )
& ~ strictorderedP(sK57)
& sK57 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP6(X3,X2) )
& ~ strictorderedP(sK57)
& sK57 = X2
& sK58 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f353,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP6(X3,X2) )
& ~ strictorderedP(sK57)
& sK57 = X2
& sK58 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK59
& nil = X3 )
| sP6(X3,sK59) )
& ~ strictorderedP(sK57)
& sK57 = sK59
& sK58 = X3
& ssList(X3) )
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f354,plain,
( ? [X3] :
( ( ( nil = sK59
& nil = X3 )
| sP6(X3,sK59) )
& ~ strictorderedP(sK57)
& sK57 = sK59
& sK58 = X3
& ssList(X3) )
=> ( ( ( nil = sK59
& nil = sK60 )
| sP6(sK60,sK59) )
& ~ strictorderedP(sK57)
& sK57 = sK59
& sK58 = sK60
& ssList(sK60) ) ),
introduced(choice_axiom,[]) ).
fof(f355,plain,
( ( ( nil = sK59
& nil = sK60 )
| sP6(sK60,sK59) )
& ~ strictorderedP(sK57)
& sK57 = sK59
& sK58 = sK60
& ssList(sK60)
& ssList(sK59)
& ssList(sK58)
& ssList(sK57) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK57,sK58,sK59,sK60])],[f233,f354,f353,f352,f351]) ).
fof(f517,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f183]) ).
fof(f518,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f555,plain,
! [X0,X1] :
( ssItem(sK54(X0,X1))
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f350]) ).
fof(f558,plain,
! [X0,X1] :
( cons(sK54(X0,X1),nil) = X1
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f350]) ).
fof(f567,plain,
sK57 = sK59,
inference(cnf_transformation,[],[f355]) ).
fof(f568,plain,
~ strictorderedP(sK57),
inference(cnf_transformation,[],[f355]) ).
fof(f570,plain,
( nil = sK59
| sP6(sK60,sK59) ),
inference(cnf_transformation,[],[f355]) ).
fof(f571,plain,
~ strictorderedP(sK59),
inference(definition_unfolding,[],[f568,f567]) ).
cnf(c_209,plain,
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f517]) ).
cnf(c_210,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f518]) ).
cnf(c_249,plain,
( ~ sP6(X0,X1)
| cons(sK54(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_252,plain,
( ~ sP6(X0,X1)
| ssItem(sK54(X0,X1)) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_253,negated_conjecture,
( nil = sK59
| sP6(sK60,sK59) ),
inference(cnf_transformation,[],[f570]) ).
cnf(c_255,negated_conjecture,
~ strictorderedP(sK59),
inference(cnf_transformation,[],[f571]) ).
cnf(c_3304,plain,
( X0 != sK60
| X1 != sK59
| nil = sK59
| ssItem(sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_252,c_253]) ).
cnf(c_3305,plain,
( nil = sK59
| ssItem(sK54(sK60,sK59)) ),
inference(unflattening,[status(thm)],[c_3304]) ).
cnf(c_3352,plain,
( X0 != sK60
| X1 != sK59
| cons(sK54(X0,X1),nil) = X1
| nil = sK59 ),
inference(resolution_lifted,[status(thm)],[c_249,c_253]) ).
cnf(c_3353,plain,
( cons(sK54(sK60,sK59),nil) = sK59
| nil = sK59 ),
inference(unflattening,[status(thm)],[c_3352]) ).
cnf(c_12399,plain,
( ~ ssItem(sK54(sK60,sK59))
| nil = sK59
| strictorderedP(sK59) ),
inference(superposition,[status(thm)],[c_3353,c_209]) ).
cnf(c_12404,plain,
( ~ ssItem(sK54(sK60,sK59))
| nil = sK59 ),
inference(forward_subsumption_resolution,[status(thm)],[c_12399,c_255]) ).
cnf(c_12456,plain,
nil = sK59,
inference(global_subsumption_just,[status(thm)],[c_12404,c_3305,c_12404]) ).
cnf(c_12458,plain,
~ strictorderedP(nil),
inference(demodulation,[status(thm)],[c_255,c_12456]) ).
cnf(c_12460,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12458,c_210]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC288+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n014.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 : Mon Aug 28 15:37:46 EDT 2023
% 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 --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.29/1.67 % SZS status Started for theBenchmark.p
% 7.29/1.67 % SZS status Theorem for theBenchmark.p
% 7.29/1.67
% 7.29/1.67 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.29/1.67
% 7.29/1.67 ------ iProver source info
% 7.29/1.67
% 7.29/1.67 git: date: 2023-05-31 18:12:56 +0000
% 7.29/1.67 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.29/1.67 git: non_committed_changes: false
% 7.29/1.67 git: last_make_outside_of_git: false
% 7.29/1.67
% 7.29/1.67 ------ Parsing...
% 7.29/1.67 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.29/1.67
% 7.29/1.67 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e
% 7.29/1.67
% 7.29/1.67 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.29/1.67
% 7.29/1.67 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.29/1.67 ------ Proving...
% 7.29/1.67 ------ Problem Properties
% 7.29/1.67
% 7.29/1.67
% 7.29/1.67 clauses 197
% 7.29/1.67 conjectures 3
% 7.29/1.67 EPR 52
% 7.29/1.67 Horn 119
% 7.29/1.67 unary 19
% 7.29/1.67 binary 50
% 7.29/1.67 lits 657
% 7.29/1.67 lits eq 96
% 7.29/1.67 fd_pure 0
% 7.29/1.67 fd_pseudo 0
% 7.29/1.67 fd_cond 21
% 7.29/1.67 fd_pseudo_cond 14
% 7.29/1.67 AC symbols 0
% 7.29/1.67
% 7.29/1.67 ------ Schedule dynamic 5 is on
% 7.29/1.67
% 7.29/1.67 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.29/1.67
% 7.29/1.67
% 7.29/1.67 ------
% 7.29/1.67 Current options:
% 7.29/1.67 ------
% 7.29/1.67
% 7.29/1.67
% 7.29/1.67
% 7.29/1.67
% 7.29/1.67 ------ Proving...
% 7.29/1.67
% 7.29/1.67
% 7.29/1.67 % SZS status Theorem for theBenchmark.p
% 7.29/1.67
% 7.29/1.67 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.29/1.67
% 7.29/1.68
%------------------------------------------------------------------------------