TSTP Solution File: SWC411+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC411+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:43:13 EDT 2023
% Result : Theorem 3.69s 1.10s
% Output : CNFRefutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 181 ( 30 equ)
% Maximal formula atoms : 24 ( 7 avg)
% Number of connectives : 213 ( 57 ~; 39 |; 97 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 66 ( 0 sgn; 27 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X5] :
( ssItem(X5)
=> ( memberP(X0,X5)
| ~ memberP(X1,X5) ) )
| ? [X4] :
( memberP(X3,X4)
& ~ memberP(X2,X4)
& ssItem(X4) )
| 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)
=> ( ! [X5] :
( ssItem(X5)
=> ( memberP(X0,X5)
| ~ memberP(X1,X5) ) )
| ? [X4] :
( memberP(X3,X4)
& ~ memberP(X2,X4)
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ( memberP(X0,X4)
| ~ memberP(X1,X4) ) )
| ? [X5] :
( memberP(X3,X5)
& ~ memberP(X2,X5)
& ssItem(X5) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X0,X4)
& memberP(X1,X4)
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X3,X5)
| memberP(X2,X5)
| ~ ssItem(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X0,X4)
& memberP(X1,X4)
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X3,X5)
| memberP(X2,X5)
| ~ ssItem(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X0,X4)
& memberP(X1,X4)
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X3,X5)
| memberP(X2,X5)
| ~ ssItem(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(X1,X4)
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X3,X5)
| memberP(X2,X5)
| ~ ssItem(X5) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(X1,X4)
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X3,X5)
| memberP(X2,X5)
| ~ ssItem(X5) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(sK54,X4)
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X3,X5)
| memberP(X2,X5)
| ~ ssItem(X5) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(sK54,X4)
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X3,X5)
| memberP(X2,X5)
| ~ ssItem(X5) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(sK54,X4)
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X3,X5)
| memberP(sK55,X5)
| ~ ssItem(X5) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(sK54,X4)
& ssItem(X4) )
& ! [X5] :
( ~ memberP(X3,X5)
| memberP(sK55,X5)
| ~ ssItem(X5) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(sK54,X4)
& ssItem(X4) )
& ! [X5] :
( ~ memberP(sK56,X5)
| memberP(sK55,X5)
| ~ ssItem(X5) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( ~ memberP(sK53,X4)
& memberP(sK54,X4)
& ssItem(X4) )
=> ( ~ memberP(sK53,sK57)
& memberP(sK54,sK57)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ~ memberP(sK53,sK57)
& memberP(sK54,sK57)
& ssItem(sK57)
& ! [X5] :
( ~ memberP(sK56,X5)
| memberP(sK55,X5)
| ~ ssItem(X5) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f223,f348,f347,f346,f345,f344]) ).
fof(f553,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f349]) ).
fof(f554,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f349]) ).
fof(f555,plain,
! [X5] :
( ~ memberP(sK56,X5)
| memberP(sK55,X5)
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f349]) ).
fof(f557,plain,
memberP(sK54,sK57),
inference(cnf_transformation,[],[f349]) ).
fof(f558,plain,
~ memberP(sK53,sK57),
inference(cnf_transformation,[],[f349]) ).
fof(f559,plain,
~ memberP(sK55,sK57),
inference(definition_unfolding,[],[f558,f554]) ).
fof(f560,plain,
memberP(sK56,sK57),
inference(definition_unfolding,[],[f557,f553]) ).
cnf(c_246,negated_conjecture,
~ memberP(sK55,sK57),
inference(cnf_transformation,[],[f559]) ).
cnf(c_247,negated_conjecture,
memberP(sK56,sK57),
inference(cnf_transformation,[],[f560]) ).
cnf(c_248,negated_conjecture,
ssItem(sK57),
inference(cnf_transformation,[],[f556]) ).
cnf(c_249,negated_conjecture,
( ~ memberP(sK56,X0)
| ~ ssItem(X0)
| memberP(sK55,X0) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_11614,plain,
( ~ ssItem(sK57)
| memberP(sK55,sK57) ),
inference(superposition,[status(thm)],[c_247,c_249]) ).
cnf(c_11615,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11614,c_246,c_248]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC411+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n015.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Aug 28 17:50:55 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.69/1.10 % SZS status Started for theBenchmark.p
% 3.69/1.10 % SZS status Theorem for theBenchmark.p
% 3.69/1.10
% 3.69/1.10 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.69/1.10
% 3.69/1.10 ------ iProver source info
% 3.69/1.10
% 3.69/1.10 git: date: 2023-05-31 18:12:56 +0000
% 3.69/1.10 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.69/1.10 git: non_committed_changes: false
% 3.69/1.10 git: last_make_outside_of_git: false
% 3.69/1.10
% 3.69/1.10 ------ Parsing...
% 3.69/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.69/1.10
% 3.69/1.10 ------ 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.69/1.10
% 3.69/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.69/1.10
% 3.69/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.69/1.10 ------ Proving...
% 3.69/1.10 ------ Problem Properties
% 3.69/1.10
% 3.69/1.10
% 3.69/1.10 clauses 186
% 3.69/1.10 conjectures 6
% 3.69/1.10 EPR 55
% 3.69/1.10 Horn 118
% 3.69/1.10 unary 21
% 3.69/1.10 binary 40
% 3.69/1.10 lits 626
% 3.69/1.10 lits eq 78
% 3.69/1.10 fd_pure 0
% 3.69/1.10 fd_pseudo 0
% 3.69/1.10 fd_cond 21
% 3.69/1.10 fd_pseudo_cond 14
% 3.69/1.10 AC symbols 0
% 3.69/1.10
% 3.69/1.10 ------ Schedule dynamic 5 is on
% 3.69/1.10
% 3.69/1.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.69/1.10
% 3.69/1.10
% 3.69/1.10 ------
% 3.69/1.10 Current options:
% 3.69/1.10 ------
% 3.69/1.10
% 3.69/1.10
% 3.69/1.10
% 3.69/1.10
% 3.69/1.10 ------ Proving...
% 3.69/1.10
% 3.69/1.10
% 3.69/1.10 % SZS status Theorem for theBenchmark.p
% 3.69/1.10
% 3.69/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.69/1.10
% 3.69/1.10
%------------------------------------------------------------------------------