TSTP Solution File: SEU162+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU162+3 : TPTP v8.1.2. Released v3.2.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:04:16 EDT 2023
% Result : Theorem 1.73s 1.14s
% Output : CNFRefutation 1.73s
% 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(f2,axiom,
! [X0,X1] :
~ ( in(X0,X1)
& disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l25_zfmisc_1) ).
fof(f3,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,[],[f2]) ).
fof(f12,plain,
! [X0,X1] :
( disjoint(singleton(X0),X1)
| in(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
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(f19,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(f20,plain,
( ? [X0,X1] :
( ( in(X1,X0)
| set_difference(X0,singleton(X1)) != X0 )
& ( ~ in(X1,X0)
| set_difference(X0,singleton(X1)) = X0 ) )
=> ( ( in(sK3,sK2)
| sK2 != set_difference(sK2,singleton(sK3)) )
& ( ~ in(sK3,sK2)
| sK2 = set_difference(sK2,singleton(sK3)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( ( in(sK3,sK2)
| sK2 != set_difference(sK2,singleton(sK3)) )
& ( ~ in(sK3,sK2)
| sK2 = set_difference(sK2,singleton(sK3)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f19,f20]) ).
fof(f22,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_difference(X0,X1) != X0 )
& ( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f24,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ disjoint(singleton(X0),X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f25,plain,
! [X0,X1] :
( disjoint(singleton(X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f28,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f29,plain,
( ~ in(sK3,sK2)
| sK2 = set_difference(sK2,singleton(sK3)) ),
inference(cnf_transformation,[],[f21]) ).
fof(f30,plain,
( in(sK3,sK2)
| sK2 != set_difference(sK2,singleton(sK3)) ),
inference(cnf_transformation,[],[f21]) ).
fof(f31,plain,
! [X0,X1] :
( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f32,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_difference(X0,X1) != X0 ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_50,plain,
( ~ disjoint(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_51,plain,
( disjoint(singleton(X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_54,plain,
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_55,negated_conjecture,
( set_difference(sK2,singleton(sK3)) != sK2
| in(sK3,sK2) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_56,negated_conjecture,
( ~ in(sK3,sK2)
| set_difference(sK2,singleton(sK3)) = sK2 ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_57,plain,
( set_difference(X0,X1) != X0
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_58,plain,
( ~ disjoint(X0,X1)
| set_difference(X0,X1) = X0 ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_568,plain,
( disjoint(X0,singleton(X1))
| in(X1,X0) ),
inference(superposition,[status(thm)],[c_51,c_54]) ).
cnf(c_602,plain,
( set_difference(X0,singleton(X1)) = X0
| in(X1,X0) ),
inference(superposition,[status(thm)],[c_568,c_58]) ).
cnf(c_613,plain,
in(sK3,sK2),
inference(backward_subsumption_resolution,[status(thm)],[c_55,c_602]) ).
cnf(c_614,plain,
set_difference(sK2,singleton(sK3)) = sK2,
inference(backward_subsumption_resolution,[status(thm)],[c_56,c_602]) ).
cnf(c_624,plain,
disjoint(sK2,singleton(sK3)),
inference(superposition,[status(thm)],[c_614,c_57]) ).
cnf(c_626,plain,
disjoint(singleton(sK3),sK2),
inference(superposition,[status(thm)],[c_624,c_54]) ).
cnf(c_627,plain,
~ in(sK3,sK2),
inference(superposition,[status(thm)],[c_626,c_50]) ).
cnf(c_630,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_627,c_613]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU162+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n002.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 17:26:16 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.73/1.14 % SZS status Started for theBenchmark.p
% 1.73/1.14 % SZS status Theorem for theBenchmark.p
% 1.73/1.14
% 1.73/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.73/1.14
% 1.73/1.14 ------ iProver source info
% 1.73/1.14
% 1.73/1.14 git: date: 2023-05-31 18:12:56 +0000
% 1.73/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.73/1.14 git: non_committed_changes: false
% 1.73/1.14 git: last_make_outside_of_git: false
% 1.73/1.14
% 1.73/1.14 ------ Parsing...
% 1.73/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.73/1.14
% 1.73/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 1.73/1.14
% 1.73/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.73/1.14
% 1.73/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.73/1.14 ------ Proving...
% 1.73/1.14 ------ Problem Properties
% 1.73/1.14
% 1.73/1.14
% 1.73/1.14 clauses 9
% 1.73/1.14 conjectures 2
% 1.73/1.14 EPR 3
% 1.73/1.14 Horn 8
% 1.73/1.14 unary 1
% 1.73/1.14 binary 8
% 1.73/1.14 lits 17
% 1.73/1.14 lits eq 5
% 1.73/1.14 fd_pure 0
% 1.73/1.14 fd_pseudo 0
% 1.73/1.14 fd_cond 0
% 1.73/1.14 fd_pseudo_cond 0
% 1.73/1.14 AC symbols 0
% 1.73/1.14
% 1.73/1.14 ------ Schedule dynamic 5 is on
% 1.73/1.14
% 1.73/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.73/1.14
% 1.73/1.14
% 1.73/1.14 ------
% 1.73/1.14 Current options:
% 1.73/1.14 ------
% 1.73/1.14
% 1.73/1.14
% 1.73/1.14
% 1.73/1.14
% 1.73/1.14 ------ Proving...
% 1.73/1.14
% 1.73/1.14
% 1.73/1.14 % SZS status Theorem for theBenchmark.p
% 1.73/1.14
% 1.73/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.73/1.14
% 1.73/1.14
%------------------------------------------------------------------------------