TSTP Solution File: SEU120+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU120+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:48 EDT 2023
% Result : Theorem 1.78s 1.17s
% Output : CNFRefutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 7 unt; 0 def)
% Number of atoms : 83 ( 19 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 93 ( 43 ~; 24 |; 21 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 56 ( 2 sgn; 35 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f12,conjecture,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f15,plain,
~ ! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f13]) ).
fof(f18,plain,
? [X0,X1] :
( ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
| ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f19,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f20,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f19]) ).
fof(f21,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK0(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0] :
( ( empty_set = X0
| in(sK0(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f20,f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f28,plain,
( ? [X0,X1] :
( ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
| ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) )
=> ( ( disjoint(sK3,sK4)
& ? [X2] : in(X2,set_intersection2(sK3,sK4)) )
| ( ! [X3] : ~ in(X3,set_intersection2(sK3,sK4))
& ~ disjoint(sK3,sK4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
( ? [X2] : in(X2,set_intersection2(sK3,sK4))
=> in(sK5,set_intersection2(sK3,sK4)) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
( ( disjoint(sK3,sK4)
& in(sK5,set_intersection2(sK3,sK4)) )
| ( ! [X3] : ~ in(X3,set_intersection2(sK3,sK4))
& ~ disjoint(sK3,sK4) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f18,f29,f28]) ).
fof(f33,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f22]) ).
fof(f34,plain,
! [X0] :
( empty_set = X0
| in(sK0(X0),X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f35,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f36,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(cnf_transformation,[],[f23]) ).
fof(f42,plain,
( in(sK5,set_intersection2(sK3,sK4))
| ~ disjoint(sK3,sK4) ),
inference(cnf_transformation,[],[f30]) ).
fof(f45,plain,
! [X3] :
( disjoint(sK3,sK4)
| ~ in(X3,set_intersection2(sK3,sK4)) ),
inference(cnf_transformation,[],[f30]) ).
fof(f46,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f33]) ).
cnf(c_51,plain,
( X0 = empty_set
| in(sK0(X0),X0) ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_52,plain,
~ in(X0,empty_set),
inference(cnf_transformation,[],[f46]) ).
cnf(c_53,plain,
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_54,plain,
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_60,negated_conjecture,
( ~ in(X0,set_intersection2(sK3,sK4))
| disjoint(sK3,sK4) ),
inference(cnf_transformation,[],[f45]) ).
cnf(c_62,negated_conjecture,
( ~ disjoint(sK3,sK4)
| in(sK5,set_intersection2(sK3,sK4)) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_536,plain,
( set_intersection2(sK3,sK4) = empty_set
| disjoint(sK3,sK4) ),
inference(superposition,[status(thm)],[c_51,c_60]) ).
cnf(c_568,plain,
disjoint(sK3,sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_536,c_53]) ).
cnf(c_569,plain,
in(sK5,set_intersection2(sK3,sK4)),
inference(backward_subsumption_resolution,[status(thm)],[c_62,c_568]) ).
cnf(c_579,plain,
set_intersection2(sK3,sK4) = empty_set,
inference(superposition,[status(thm)],[c_568,c_54]) ).
cnf(c_583,plain,
in(sK5,empty_set),
inference(demodulation,[status(thm)],[c_569,c_579]) ).
cnf(c_584,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_583,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU120+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.15 % Command : run_iprover %s %d THM
% 0.11/0.35 % Computer : n002.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8042.1875MB
% 0.11/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Wed Aug 23 19:38:46 EDT 2023
% 0.11/0.35 % CPUTime :
% 0.16/0.46 Running first-order theorem proving
% 0.16/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.78/1.17 % SZS status Started for theBenchmark.p
% 1.78/1.17 % SZS status Theorem for theBenchmark.p
% 1.78/1.17
% 1.78/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.78/1.17
% 1.78/1.17 ------ iProver source info
% 1.78/1.17
% 1.78/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.78/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.78/1.17 git: non_committed_changes: false
% 1.78/1.17 git: last_make_outside_of_git: false
% 1.78/1.17
% 1.78/1.17 ------ Parsing...
% 1.78/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.78/1.17
% 1.78/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.78/1.17
% 1.78/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.78/1.17
% 1.78/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.78/1.17 ------ Proving...
% 1.78/1.17 ------ Problem Properties
% 1.78/1.17
% 1.78/1.17
% 1.78/1.17 clauses 14
% 1.78/1.17 conjectures 3
% 1.78/1.17 EPR 6
% 1.78/1.17 Horn 13
% 1.78/1.17 unary 6
% 1.78/1.17 binary 8
% 1.78/1.17 lits 22
% 1.78/1.17 lits eq 5
% 1.78/1.17 fd_pure 0
% 1.78/1.17 fd_pseudo 0
% 1.78/1.17 fd_cond 1
% 1.78/1.17 fd_pseudo_cond 0
% 1.78/1.17 AC symbols 0
% 1.78/1.17
% 1.78/1.17 ------ Schedule dynamic 5 is on
% 1.78/1.17
% 1.78/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.78/1.17
% 1.78/1.17
% 1.78/1.17 ------
% 1.78/1.17 Current options:
% 1.78/1.17 ------
% 1.78/1.17
% 1.78/1.17
% 1.78/1.17
% 1.78/1.17
% 1.78/1.17 ------ Proving...
% 1.78/1.17
% 1.78/1.17
% 1.78/1.17 % SZS status Theorem for theBenchmark.p
% 1.78/1.17
% 1.78/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.78/1.17
% 1.78/1.17
%------------------------------------------------------------------------------