TSTP Solution File: SEU162+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU162+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:04:15 EDT 2023
% Result : Theorem 1.70s 1.19s
% Output : CNFRefutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 78 ( 24 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 76 ( 34 ~; 29 |; 6 &)
% ( 3 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn; 30 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
~ ( in(X0,X1)
& disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l25_zfmisc_1) ).
fof(f5,axiom,
! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_zfmisc_1) ).
fof(f6,axiom,
! [X0,X1] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f7,conjecture,
! [X0,X1] :
( set_difference(X0,singleton(X1)) = X0
<=> ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t65_zfmisc_1) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( set_difference(X0,singleton(X1)) = X0
<=> ~ in(X1,X0) ),
inference(negated_conjecture,[],[f7]) ).
fof(f9,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(f11,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ disjoint(singleton(X0),X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f12,plain,
! [X0,X1] :
( disjoint(singleton(X0),X1)
| in(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f13,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f14,plain,
? [X0,X1] :
( set_difference(X0,singleton(X1)) = X0
<~> ~ in(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f15,plain,
? [X0,X1] :
( ( in(X1,X0)
| set_difference(X0,singleton(X1)) != X0 )
& ( ~ in(X1,X0)
| set_difference(X0,singleton(X1)) = X0 ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f16,plain,
( ? [X0,X1] :
( ( in(X1,X0)
| set_difference(X0,singleton(X1)) != X0 )
& ( ~ in(X1,X0)
| set_difference(X0,singleton(X1)) = X0 ) )
=> ( ( in(sK1,sK0)
| sK0 != set_difference(sK0,singleton(sK1)) )
& ( ~ in(sK1,sK0)
| sK0 = set_difference(sK0,singleton(sK1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ( in(sK1,sK0)
| sK0 != set_difference(sK0,singleton(sK1)) )
& ( ~ in(sK1,sK0)
| sK0 = set_difference(sK0,singleton(sK1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f15,f16]) ).
fof(f18,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_difference(X0,X1) != X0 )
& ( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f20,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ disjoint(singleton(X0),X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f21,plain,
! [X0,X1] :
( disjoint(singleton(X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f22,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f23,plain,
( ~ in(sK1,sK0)
| sK0 = set_difference(sK0,singleton(sK1)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f24,plain,
( in(sK1,sK0)
| sK0 != set_difference(sK0,singleton(sK1)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f25,plain,
! [X0,X1] :
( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f26,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_difference(X0,X1) != X0 ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_50,plain,
( ~ disjoint(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_51,plain,
( disjoint(singleton(X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_52,plain,
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_53,negated_conjecture,
( set_difference(sK0,singleton(sK1)) != sK0
| in(sK1,sK0) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_54,negated_conjecture,
( ~ in(sK1,sK0)
| set_difference(sK0,singleton(sK1)) = sK0 ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_55,plain,
( set_difference(X0,X1) != X0
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_56,plain,
( ~ disjoint(X0,X1)
| set_difference(X0,X1) = X0 ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_436,plain,
( disjoint(X0,singleton(X1))
| in(X1,X0) ),
inference(superposition,[status(thm)],[c_51,c_52]) ).
cnf(c_470,plain,
( set_difference(X0,singleton(X1)) = X0
| in(X1,X0) ),
inference(superposition,[status(thm)],[c_436,c_56]) ).
cnf(c_481,plain,
in(sK1,sK0),
inference(backward_subsumption_resolution,[status(thm)],[c_53,c_470]) ).
cnf(c_482,plain,
set_difference(sK0,singleton(sK1)) = sK0,
inference(backward_subsumption_resolution,[status(thm)],[c_54,c_470]) ).
cnf(c_492,plain,
disjoint(sK0,singleton(sK1)),
inference(superposition,[status(thm)],[c_482,c_55]) ).
cnf(c_494,plain,
disjoint(singleton(sK1),sK0),
inference(superposition,[status(thm)],[c_492,c_52]) ).
cnf(c_495,plain,
~ in(sK1,sK0),
inference(superposition,[status(thm)],[c_494,c_50]) ).
cnf(c_498,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_495,c_481]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU162+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15 % Command : run_iprover %s %d THM
% 0.18/0.36 % Computer : n019.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Wed Aug 23 14:41:14 EDT 2023
% 0.18/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.70/1.19 % SZS status Started for theBenchmark.p
% 1.70/1.19 % SZS status Theorem for theBenchmark.p
% 1.70/1.19
% 1.70/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.70/1.19
% 1.70/1.19 ------ iProver source info
% 1.70/1.19
% 1.70/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.70/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.70/1.19 git: non_committed_changes: false
% 1.70/1.19 git: last_make_outside_of_git: false
% 1.70/1.19
% 1.70/1.19 ------ Parsing...
% 1.70/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.70/1.19
% 1.70/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.70/1.19
% 1.70/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.70/1.19
% 1.70/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.70/1.19 ------ Proving...
% 1.70/1.19 ------ Problem Properties
% 1.70/1.19
% 1.70/1.19
% 1.70/1.19 clauses 8
% 1.70/1.19 conjectures 2
% 1.70/1.19 EPR 2
% 1.70/1.19 Horn 7
% 1.70/1.19 unary 0
% 1.70/1.19 binary 8
% 1.70/1.19 lits 16
% 1.70/1.19 lits eq 4
% 1.70/1.19 fd_pure 0
% 1.70/1.19 fd_pseudo 0
% 1.70/1.19 fd_cond 0
% 1.70/1.19 fd_pseudo_cond 0
% 1.70/1.19 AC symbols 0
% 1.70/1.19
% 1.70/1.19 ------ Schedule dynamic 5 is on
% 1.70/1.19
% 1.70/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.70/1.19
% 1.70/1.19
% 1.70/1.19 ------
% 1.70/1.19 Current options:
% 1.70/1.19 ------
% 1.70/1.19
% 1.70/1.19
% 1.70/1.19
% 1.70/1.19
% 1.70/1.19 ------ Proving...
% 1.70/1.19
% 1.70/1.19
% 1.70/1.19 % SZS status Theorem for theBenchmark.p
% 1.70/1.19
% 1.70/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.70/1.19
% 1.70/1.19
%------------------------------------------------------------------------------