TSTP Solution File: SEU121+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU121+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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 17:03:49 EDT 2023
% Result : Theorem 2.60s 1.15s
% Output : CNFRefutation 2.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 9 unt; 0 def)
% Number of atoms : 94 ( 4 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 100 ( 41 ~; 32 |; 20 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn; 30 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f15,conjecture,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f16,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
inference(negated_conjecture,[],[f15]) ).
fof(f27,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f29,plain,
? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f30,plain,
? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) ),
inference(flattening,[],[f29]) ).
fof(f40,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f41,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f40]) ).
fof(f42,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f41,f42]) ).
fof(f54,plain,
( ? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) )
=> ( ~ subset(sK5,sK7)
& subset(sK6,sK7)
& subset(sK5,sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f55,plain,
( ~ subset(sK5,sK7)
& subset(sK6,sK7)
& subset(sK5,sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f30,f54]) ).
fof(f64,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f65,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f66,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f81,plain,
subset(sK5,sK6),
inference(cnf_transformation,[],[f55]) ).
fof(f82,plain,
subset(sK6,sK7),
inference(cnf_transformation,[],[f55]) ).
fof(f83,plain,
~ subset(sK5,sK7),
inference(cnf_transformation,[],[f55]) ).
cnf(c_53,plain,
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_54,plain,
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_55,plain,
( ~ in(X0,X1)
| ~ subset(X1,X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_70,negated_conjecture,
~ subset(sK5,sK7),
inference(cnf_transformation,[],[f83]) ).
cnf(c_71,negated_conjecture,
subset(sK6,sK7),
inference(cnf_transformation,[],[f82]) ).
cnf(c_72,negated_conjecture,
subset(sK5,sK6),
inference(cnf_transformation,[],[f81]) ).
cnf(c_104,plain,
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_53]) ).
cnf(c_138,plain,
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_54]) ).
cnf(c_447,plain,
( X0 != sK5
| X1 != sK7
| in(sK1(X0,X1),X0) ),
inference(resolution_lifted,[status(thm)],[c_138,c_70]) ).
cnf(c_448,plain,
in(sK1(sK5,sK7),sK5),
inference(unflattening,[status(thm)],[c_447]) ).
cnf(c_452,plain,
( X0 != sK5
| X1 != sK7
| ~ in(sK1(X0,X1),X1) ),
inference(resolution_lifted,[status(thm)],[c_104,c_70]) ).
cnf(c_453,plain,
~ in(sK1(sK5,sK7),sK7),
inference(unflattening,[status(thm)],[c_452]) ).
cnf(c_1350,plain,
( ~ in(sK1(sK5,sK7),sK5)
| ~ subset(sK5,X0)
| in(sK1(sK5,sK7),X0) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_1687,plain,
( ~ in(sK1(sK5,sK7),sK5)
| ~ subset(sK5,sK6)
| in(sK1(sK5,sK7),sK6) ),
inference(instantiation,[status(thm)],[c_1350]) ).
cnf(c_1961,plain,
( ~ in(sK1(sK5,sK7),sK6)
| ~ subset(sK6,X0)
| in(sK1(sK5,sK7),X0) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_4483,plain,
( ~ in(sK1(sK5,sK7),sK6)
| ~ subset(sK6,sK7)
| in(sK1(sK5,sK7),sK7) ),
inference(instantiation,[status(thm)],[c_1961]) ).
cnf(c_4484,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4483,c_1687,c_453,c_448,c_71,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU121+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Aug 23 16:50:52 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.60/1.15 % SZS status Started for theBenchmark.p
% 2.60/1.15 % SZS status Theorem for theBenchmark.p
% 2.60/1.15
% 2.60/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.60/1.15
% 2.60/1.15 ------ iProver source info
% 2.60/1.15
% 2.60/1.15 git: date: 2023-05-31 18:12:56 +0000
% 2.60/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.60/1.15 git: non_committed_changes: false
% 2.60/1.15 git: last_make_outside_of_git: false
% 2.60/1.15
% 2.60/1.15 ------ Parsing...
% 2.60/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.60/1.15
% 2.60/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.60/1.15
% 2.60/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.60/1.15
% 2.60/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.60/1.15 ------ Proving...
% 2.60/1.15 ------ Problem Properties
% 2.60/1.15
% 2.60/1.15
% 2.60/1.15 clauses 32
% 2.60/1.15 conjectures 3
% 2.60/1.15 EPR 15
% 2.60/1.15 Horn 25
% 2.60/1.15 unary 10
% 2.60/1.15 binary 15
% 2.60/1.15 lits 62
% 2.60/1.15 lits eq 10
% 2.60/1.15 fd_pure 0
% 2.60/1.15 fd_pseudo 0
% 2.60/1.15 fd_cond 2
% 2.60/1.15 fd_pseudo_cond 4
% 2.60/1.15 AC symbols 0
% 2.60/1.15
% 2.60/1.15 ------ Schedule dynamic 5 is on
% 2.60/1.15
% 2.60/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.60/1.15
% 2.60/1.15
% 2.60/1.15 ------
% 2.60/1.15 Current options:
% 2.60/1.15 ------
% 2.60/1.15
% 2.60/1.15
% 2.60/1.15
% 2.60/1.15
% 2.60/1.15 ------ Proving...
% 2.60/1.15
% 2.60/1.15
% 2.60/1.15 % SZS status Theorem for theBenchmark.p
% 2.60/1.15
% 2.60/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.60/1.15
% 2.60/1.15
%------------------------------------------------------------------------------