TSTP Solution File: SET063+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET063+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:06:04 EDT 2023
% Result : Theorem 1.61s 1.16s
% Output : CNFRefutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 43 ( 16 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 42 ( 18 ~; 11 |; 9 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 17 ( 1 sgn; 12 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_subset) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f7,conjecture,
! [X0] :
( subset(X0,empty_set)
=> empty_set = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subset_of_empty_set_is_empty_set) ).
fof(f8,negated_conjecture,
~ ! [X0] :
( subset(X0,empty_set)
=> empty_set = X0 ),
inference(negated_conjecture,[],[f7]) ).
fof(f10,plain,
? [X0] :
( empty_set != X0
& subset(X0,empty_set) ),
inference(ennf_transformation,[],[f8]) ).
fof(f15,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f16,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
( ? [X0] :
( empty_set != X0
& subset(X0,empty_set) )
=> ( empty_set != sK1
& subset(sK1,empty_set) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( empty_set != sK1
& subset(sK1,empty_set) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f10,f17]) ).
fof(f19,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f26,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f28,plain,
subset(sK1,empty_set),
inference(cnf_transformation,[],[f18]) ).
fof(f29,plain,
empty_set != sK1,
inference(cnf_transformation,[],[f18]) ).
cnf(c_49,plain,
subset(empty_set,X0),
inference(cnf_transformation,[],[f19]) ).
cnf(c_54,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_58,negated_conjecture,
empty_set != sK1,
inference(cnf_transformation,[],[f29]) ).
cnf(c_59,negated_conjecture,
subset(sK1,empty_set),
inference(cnf_transformation,[],[f28]) ).
cnf(c_312,plain,
( ~ subset(empty_set,sK1)
| empty_set = sK1 ),
inference(superposition,[status(thm)],[c_59,c_54]) ).
cnf(c_313,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_312,c_58,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET063+3 : TPTP v8.1.2. Released v2.2.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n021.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 : Sat Aug 26 14:04:27 EDT 2023
% 0.13/0.34 % 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
% 1.61/1.16 % SZS status Started for theBenchmark.p
% 1.61/1.16 % SZS status Theorem for theBenchmark.p
% 1.61/1.16
% 1.61/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.61/1.16
% 1.61/1.16 ------ iProver source info
% 1.61/1.16
% 1.61/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.61/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.61/1.16 git: non_committed_changes: false
% 1.61/1.16 git: last_make_outside_of_git: false
% 1.61/1.16
% 1.61/1.16 ------ Parsing...
% 1.61/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.61/1.16
% 1.61/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.61/1.16
% 1.61/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.61/1.16
% 1.61/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.61/1.16 ------ Proving...
% 1.61/1.16 ------ Problem Properties
% 1.61/1.16
% 1.61/1.16
% 1.61/1.16 clauses 9
% 1.61/1.16 conjectures 2
% 1.61/1.16 EPR 7
% 1.61/1.16 Horn 8
% 1.61/1.16 unary 5
% 1.61/1.16 binary 2
% 1.61/1.16 lits 15
% 1.61/1.16 lits eq 2
% 1.61/1.16 fd_pure 0
% 1.61/1.16 fd_pseudo 0
% 1.61/1.16 fd_cond 0
% 1.61/1.16 fd_pseudo_cond 1
% 1.61/1.16 AC symbols 0
% 1.61/1.16
% 1.61/1.16 ------ Schedule dynamic 5 is on
% 1.61/1.16
% 1.61/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.61/1.16
% 1.61/1.16
% 1.61/1.16 ------
% 1.61/1.16 Current options:
% 1.61/1.16 ------
% 1.61/1.16
% 1.61/1.16
% 1.61/1.16
% 1.61/1.16
% 1.61/1.16 ------ Proving...
% 1.61/1.16
% 1.61/1.16
% 1.61/1.16 % SZS status Theorem for theBenchmark.p
% 1.61/1.16
% 1.61/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.61/1.16
% 1.61/1.16
%------------------------------------------------------------------------------