TSTP Solution File: SET925+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET925+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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 15:10:39 EDT 2023
% Result : Theorem 1.59s 1.16s
% Output : CNFRefutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 4 unt; 0 def)
% Number of atoms : 60 ( 30 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 60 ( 26 ~; 24 |; 5 &)
% ( 3 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn; 12 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,conjecture,
! [X0,X1] :
( empty_set = set_difference(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t68_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1] :
( empty_set = set_difference(singleton(X0),X1)
<=> in(X0,X1) ),
inference(negated_conjecture,[],[f5]) ).
fof(f7,axiom,
! [X0,X1] :
( empty_set = set_difference(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l36_zfmisc_1) ).
fof(f9,plain,
? [X0,X1] :
( empty_set = set_difference(singleton(X0),X1)
<~> in(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f14,plain,
? [X0,X1] :
( ( ~ in(X0,X1)
| empty_set != set_difference(singleton(X0),X1) )
& ( in(X0,X1)
| empty_set = set_difference(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f15,plain,
( ? [X0,X1] :
( ( ~ in(X0,X1)
| empty_set != set_difference(singleton(X0),X1) )
& ( in(X0,X1)
| empty_set = set_difference(singleton(X0),X1) ) )
=> ( ( ~ in(sK2,sK3)
| empty_set != set_difference(singleton(sK2),sK3) )
& ( in(sK2,sK3)
| empty_set = set_difference(singleton(sK2),sK3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ( ~ in(sK2,sK3)
| empty_set != set_difference(singleton(sK2),sK3) )
& ( in(sK2,sK3)
| empty_set = set_difference(singleton(sK2),sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f14,f15]) ).
fof(f17,plain,
! [X0,X1] :
( ( empty_set = set_difference(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| empty_set != set_difference(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f22,plain,
( in(sK2,sK3)
| empty_set = set_difference(singleton(sK2),sK3) ),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
( ~ in(sK2,sK3)
| empty_set != set_difference(singleton(sK2),sK3) ),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
! [X0,X1] :
( in(X0,X1)
| empty_set != set_difference(singleton(X0),X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f25,plain,
! [X0,X1] :
( empty_set = set_difference(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_53,negated_conjecture,
( set_difference(singleton(sK2),sK3) != empty_set
| ~ in(sK2,sK3) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_54,negated_conjecture,
( set_difference(singleton(sK2),sK3) = empty_set
| in(sK2,sK3) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_55,plain,
( ~ in(X0,X1)
| set_difference(singleton(X0),X1) = empty_set ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_56,plain,
( set_difference(singleton(X0),X1) != empty_set
| in(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_59,plain,
( ~ in(sK2,sK3)
| set_difference(singleton(sK2),sK3) != empty_set ),
inference(prop_impl_just,[status(thm)],[c_53]) ).
cnf(c_60,plain,
( set_difference(singleton(sK2),sK3) != empty_set
| ~ in(sK2,sK3) ),
inference(renaming,[status(thm)],[c_59]) ).
cnf(c_61,plain,
( in(sK2,sK3)
| set_difference(singleton(sK2),sK3) = empty_set ),
inference(prop_impl_just,[status(thm)],[c_54]) ).
cnf(c_62,plain,
( set_difference(singleton(sK2),sK3) = empty_set
| in(sK2,sK3) ),
inference(renaming,[status(thm)],[c_61]) ).
cnf(c_63,plain,
( in(X0,X1)
| set_difference(singleton(X0),X1) != empty_set ),
inference(prop_impl_just,[status(thm)],[c_56]) ).
cnf(c_64,plain,
( set_difference(singleton(X0),X1) != empty_set
| in(X0,X1) ),
inference(renaming,[status(thm)],[c_63]) ).
cnf(c_99,plain,
in(sK2,sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_62,c_64]) ).
cnf(c_103,plain,
set_difference(singleton(sK2),sK3) != empty_set,
inference(backward_subsumption_resolution,[status(thm)],[c_60,c_99]) ).
cnf(c_340,plain,
set_difference(singleton(sK2),sK3) = empty_set,
inference(superposition,[status(thm)],[c_99,c_55]) ).
cnf(c_341,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_340,c_103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET925+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 15:15:08 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.59/1.16 % SZS status Started for theBenchmark.p
% 1.59/1.16 % SZS status Theorem for theBenchmark.p
% 1.59/1.16
% 1.59/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.59/1.16
% 1.59/1.16 ------ iProver source info
% 1.59/1.16
% 1.59/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.59/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.59/1.16 git: non_committed_changes: false
% 1.59/1.16 git: last_make_outside_of_git: false
% 1.59/1.16
% 1.59/1.16 ------ Parsing...
% 1.59/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.59/1.16
% 1.59/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.59/1.16
% 1.59/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.59/1.16
% 1.59/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.59/1.16 ------ Proving...
% 1.59/1.16 ------ Problem Properties
% 1.59/1.16
% 1.59/1.16
% 1.59/1.16 clauses 8
% 1.59/1.16 conjectures 0
% 1.59/1.16 EPR 5
% 1.59/1.16 Horn 8
% 1.59/1.16 unary 5
% 1.59/1.16 binary 3
% 1.59/1.16 lits 11
% 1.59/1.16 lits eq 3
% 1.59/1.16 fd_pure 0
% 1.59/1.16 fd_pseudo 0
% 1.59/1.16 fd_cond 0
% 1.59/1.16 fd_pseudo_cond 0
% 1.59/1.16 AC symbols 0
% 1.59/1.16
% 1.59/1.16 ------ Schedule dynamic 5 is on
% 1.59/1.16
% 1.59/1.16 ------ no conjectures: strip conj schedule
% 1.59/1.16
% 1.59/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.59/1.16
% 1.59/1.16
% 1.59/1.16 ------
% 1.59/1.16 Current options:
% 1.59/1.16 ------
% 1.59/1.16
% 1.59/1.16
% 1.59/1.16
% 1.59/1.16
% 1.59/1.16 ------ Proving...
% 1.59/1.16
% 1.59/1.16
% 1.59/1.16 % SZS status Theorem for theBenchmark.p
% 1.59/1.16
% 1.59/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.59/1.16
% 1.59/1.16
%------------------------------------------------------------------------------