TSTP Solution File: SET065+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET065+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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:06 EDT 2023
% Result : Theorem 3.41s 1.13s
% Output : CNFRefutation 3.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 90 ( 1 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 92 ( 34 ~; 28 |; 23 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 1 sgn; 31 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subclass_defn) ).
fof(f2,axiom,
! [X0] : subclass(X0,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',class_elements_are_sets) ).
fof(f29,axiom,
! [X0] :
( inductive(X0)
<=> ( subclass(image(successor_relation,X0),X0)
& member(null_class,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inductive_defn) ).
fof(f30,axiom,
? [X0] :
( ! [X1] :
( inductive(X1)
=> subclass(X0,X1) )
& inductive(X0)
& member(X0,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infinity) ).
fof(f44,conjecture,
member(null_class,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_class_is_a_set) ).
fof(f45,negated_conjecture,
~ member(null_class,universal_class),
inference(negated_conjecture,[],[f44]) ).
fof(f70,plain,
~ member(null_class,universal_class),
inference(flattening,[],[f45]) ).
fof(f72,plain,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f76,plain,
? [X0] :
( ! [X1] :
( subclass(X0,X1)
| ~ inductive(X1) )
& inductive(X0)
& member(X0,universal_class) ),
inference(ennf_transformation,[],[f30]) ).
fof(f85,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subclass(X0,X1) ) ),
inference(nnf_transformation,[],[f72]) ).
fof(f86,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(rectify,[],[f85]) ).
fof(f87,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f88,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f86,f87]) ).
fof(f111,plain,
! [X0] :
( ( inductive(X0)
| ~ subclass(image(successor_relation,X0),X0)
| ~ member(null_class,X0) )
& ( ( subclass(image(successor_relation,X0),X0)
& member(null_class,X0) )
| ~ inductive(X0) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f112,plain,
! [X0] :
( ( inductive(X0)
| ~ subclass(image(successor_relation,X0),X0)
| ~ member(null_class,X0) )
& ( ( subclass(image(successor_relation,X0),X0)
& member(null_class,X0) )
| ~ inductive(X0) ) ),
inference(flattening,[],[f111]) ).
fof(f113,plain,
( ? [X0] :
( ! [X1] :
( subclass(X0,X1)
| ~ inductive(X1) )
& inductive(X0)
& member(X0,universal_class) )
=> ( ! [X1] :
( subclass(sK1,X1)
| ~ inductive(X1) )
& inductive(sK1)
& member(sK1,universal_class) ) ),
introduced(choice_axiom,[]) ).
fof(f114,plain,
( ! [X1] :
( subclass(sK1,X1)
| ~ inductive(X1) )
& inductive(sK1)
& member(sK1,universal_class) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f76,f113]) ).
fof(f133,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
fof(f136,plain,
! [X0] : subclass(X0,universal_class),
inference(cnf_transformation,[],[f2]) ).
fof(f188,plain,
! [X0] :
( member(null_class,X0)
| ~ inductive(X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f192,plain,
inductive(sK1),
inference(cnf_transformation,[],[f114]) ).
fof(f220,plain,
~ member(null_class,universal_class),
inference(cnf_transformation,[],[f70]) ).
cnf(c_51,plain,
( ~ subclass(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f133]) ).
cnf(c_52,plain,
subclass(X0,universal_class),
inference(cnf_transformation,[],[f136]) ).
cnf(c_99,plain,
( ~ inductive(X0)
| member(null_class,X0) ),
inference(cnf_transformation,[],[f188]) ).
cnf(c_101,plain,
inductive(sK1),
inference(cnf_transformation,[],[f192]) ).
cnf(c_128,negated_conjecture,
~ member(null_class,universal_class),
inference(cnf_transformation,[],[f220]) ).
cnf(c_878,plain,
( X0 != sK1
| member(null_class,X0) ),
inference(resolution_lifted,[status(thm)],[c_99,c_101]) ).
cnf(c_879,plain,
member(null_class,sK1),
inference(unflattening,[status(thm)],[c_878]) ).
cnf(c_2578,plain,
( ~ subclass(sK1,X0)
| member(null_class,X0) ),
inference(superposition,[status(thm)],[c_879,c_51]) ).
cnf(c_2722,plain,
member(null_class,universal_class),
inference(superposition,[status(thm)],[c_52,c_2578]) ).
cnf(c_2724,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2722,c_128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET065+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.13/0.32 % Computer : n008.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Sat Aug 26 14:32:47 EDT 2023
% 0.13/0.32 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.41/1.13 % SZS status Started for theBenchmark.p
% 3.41/1.13 % SZS status Theorem for theBenchmark.p
% 3.41/1.13
% 3.41/1.13 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.41/1.13
% 3.41/1.13 ------ iProver source info
% 3.41/1.13
% 3.41/1.13 git: date: 2023-05-31 18:12:56 +0000
% 3.41/1.13 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.41/1.13 git: non_committed_changes: false
% 3.41/1.13 git: last_make_outside_of_git: false
% 3.41/1.13
% 3.41/1.13 ------ Parsing...
% 3.41/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.41/1.13
% 3.41/1.13 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 3.41/1.13
% 3.41/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.41/1.13
% 3.41/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.41/1.13 ------ Proving...
% 3.41/1.13 ------ Problem Properties
% 3.41/1.13
% 3.41/1.13
% 3.41/1.13 clauses 75
% 3.41/1.13 conjectures 1
% 3.41/1.13 EPR 8
% 3.41/1.13 Horn 67
% 3.41/1.13 unary 15
% 3.41/1.13 binary 39
% 3.41/1.13 lits 157
% 3.41/1.13 lits eq 14
% 3.41/1.13 fd_pure 0
% 3.41/1.13 fd_pseudo 0
% 3.41/1.13 fd_cond 4
% 3.41/1.13 fd_pseudo_cond 3
% 3.41/1.13 AC symbols 0
% 3.41/1.13
% 3.41/1.13 ------ Schedule dynamic 5 is on
% 3.41/1.13
% 3.41/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.41/1.13
% 3.41/1.13
% 3.41/1.13 ------
% 3.41/1.13 Current options:
% 3.41/1.13 ------
% 3.41/1.13
% 3.41/1.13
% 3.41/1.13
% 3.41/1.13
% 3.41/1.13 ------ Proving...
% 3.41/1.13
% 3.41/1.13
% 3.41/1.13 % SZS status Theorem for theBenchmark.p
% 3.41/1.13
% 3.41/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.41/1.13
% 3.41/1.13
%------------------------------------------------------------------------------