TSTP Solution File: SET602+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET602+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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:08:33 EDT 2023
% Result : Theorem 1.92s 1.17s
% Output : CNFRefutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 39 ( 20 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 38 ( 18 ~; 11 |; 6 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn; 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_empty_set) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f8,conjecture,
! [X0] : empty_set = difference(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_self_difference_is_empty_set) ).
fof(f9,negated_conjecture,
~ ! [X0] : empty_set = difference(X0,X0),
inference(negated_conjecture,[],[f8]) ).
fof(f11,plain,
? [X0] : empty_set != difference(X0,X0),
inference(ennf_transformation,[],[f9]) ).
fof(f12,plain,
! [X0,X1] :
( ( difference(X0,X1) = empty_set
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| difference(X0,X1) != empty_set ) ),
inference(nnf_transformation,[],[f1]) ).
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(f21,plain,
( ? [X0] : empty_set != difference(X0,X0)
=> empty_set != difference(sK1,sK1) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
empty_set != difference(sK1,sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f11,f21]) ).
fof(f24,plain,
! [X0,X1] :
( difference(X0,X1) = empty_set
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f29,plain,
! [X0,X1] :
( subset(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f16]) ).
fof(f36,plain,
empty_set != difference(sK1,sK1),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X1] : subset(X1,X1),
inference(equality_resolution,[],[f29]) ).
cnf(c_49,plain,
( ~ subset(X0,X1)
| difference(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_57,plain,
subset(X0,X0),
inference(cnf_transformation,[],[f38]) ).
cnf(c_62,negated_conjecture,
difference(sK1,sK1) != empty_set,
inference(cnf_transformation,[],[f36]) ).
cnf(c_603,plain,
difference(X0,X0) = empty_set,
inference(superposition,[status(thm)],[c_57,c_49]) ).
cnf(c_605,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_62,c_603]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET602+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.15/0.34 % Computer : n012.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Sat Aug 26 09:37:41 EDT 2023
% 0.15/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.92/1.17 % SZS status Started for theBenchmark.p
% 1.92/1.17 % SZS status Theorem for theBenchmark.p
% 1.92/1.17
% 1.92/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.92/1.17
% 1.92/1.17 ------ iProver source info
% 1.92/1.17
% 1.92/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.92/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.92/1.17 git: non_committed_changes: false
% 1.92/1.17 git: last_make_outside_of_git: false
% 1.92/1.17
% 1.92/1.17 ------ Parsing...
% 1.92/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.92/1.17
% 1.92/1.17 ------ 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.92/1.17
% 1.92/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.92/1.17
% 1.92/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.92/1.17 ------ Proving...
% 1.92/1.17 ------ Problem Properties
% 1.92/1.17
% 1.92/1.17
% 1.92/1.17 clauses 12
% 1.92/1.17 conjectures 1
% 1.92/1.17 EPR 4
% 1.92/1.17 Horn 10
% 1.92/1.17 unary 3
% 1.92/1.17 binary 6
% 1.92/1.17 lits 24
% 1.92/1.17 lits eq 4
% 1.92/1.17 fd_pure 0
% 1.92/1.17 fd_pseudo 0
% 1.92/1.17 fd_cond 0
% 1.92/1.17 fd_pseudo_cond 1
% 1.92/1.17 AC symbols 0
% 1.92/1.17
% 1.92/1.17 ------ Schedule dynamic 5 is on
% 1.92/1.17
% 1.92/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.92/1.17
% 1.92/1.17
% 1.92/1.17 ------
% 1.92/1.17 Current options:
% 1.92/1.17 ------
% 1.92/1.17
% 1.92/1.17
% 1.92/1.17
% 1.92/1.17
% 1.92/1.17 ------ Proving...
% 1.92/1.17
% 1.92/1.17
% 1.92/1.17 % SZS status Theorem for theBenchmark.p
% 1.92/1.17
% 1.92/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.92/1.17
% 1.92/1.17
%------------------------------------------------------------------------------