TSTP Solution File: SET063+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET063+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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 : Fri May 3 02:59:37 EDT 2024
% Result : Theorem 3.62s 1.17s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 78 ( 17 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 82 ( 34 ~; 23 |; 17 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 2 sgn 31 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclass_defn) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subclass(X1,X0)
& subclass(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality) ).
fof(f16,axiom,
! [X0] : ~ member(X0,null_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',null_class_defn) ).
fof(f44,conjecture,
! [X0] :
( subclass(X0,null_class)
=> null_class = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_of_null_class_is_subclass) ).
fof(f45,negated_conjecture,
~ ! [X0] :
( subclass(X0,null_class)
=> null_class = X0 ),
inference(negated_conjecture,[],[f44]) ).
fof(f71,plain,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f84,plain,
? [X0] :
( null_class != X0
& subclass(X0,null_class) ),
inference(ennf_transformation,[],[f45]) ).
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,[],[f71]) ).
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(f89,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subclass(X1,X0)
| ~ subclass(X0,X1) )
& ( ( subclass(X1,X0)
& subclass(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f90,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subclass(X1,X0)
| ~ subclass(X0,X1) )
& ( ( subclass(X1,X0)
& subclass(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f89]) ).
fof(f133,plain,
( ? [X0] :
( null_class != X0
& subclass(X0,null_class) )
=> ( null_class != sK6
& subclass(sK6,null_class) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( null_class != sK6
& subclass(sK6,null_class) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f84,f133]) ).
fof(f136,plain,
! [X0,X1] :
( subclass(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f141,plain,
! [X0,X1] :
( X0 = X1
| ~ subclass(X1,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[],[f90]) ).
fof(f166,plain,
! [X0] : ~ member(X0,null_class),
inference(cnf_transformation,[],[f16]) ).
fof(f222,plain,
subclass(sK6,null_class),
inference(cnf_transformation,[],[f134]) ).
fof(f223,plain,
null_class != sK6,
inference(cnf_transformation,[],[f134]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
cnf(c_53,plain,
( ~ subclass(X0,X1)
| ~ subclass(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f141]) ).
cnf(c_77,plain,
~ member(X0,null_class),
inference(cnf_transformation,[],[f166]) ).
cnf(c_128,negated_conjecture,
null_class != sK6,
inference(cnf_transformation,[],[f223]) ).
cnf(c_129,negated_conjecture,
subclass(sK6,null_class),
inference(cnf_transformation,[],[f222]) ).
cnf(c_1557,negated_conjecture,
subclass(sK6,null_class),
inference(demodulation,[status(thm)],[c_129]) ).
cnf(c_1558,negated_conjecture,
null_class != sK6,
inference(demodulation,[status(thm)],[c_128]) ).
cnf(c_2366,plain,
subclass(null_class,X0),
inference(superposition,[status(thm)],[c_50,c_77]) ).
cnf(c_2662,plain,
( ~ subclass(null_class,sK6)
| null_class = sK6 ),
inference(superposition,[status(thm)],[c_1557,c_53]) ).
cnf(c_2670,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2662,c_1558,c_2366]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET063+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 20:52:00 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.62/1.17 % SZS status Started for theBenchmark.p
% 3.62/1.17 % SZS status Theorem for theBenchmark.p
% 3.62/1.17
% 3.62/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.62/1.17
% 3.62/1.17 ------ iProver source info
% 3.62/1.17
% 3.62/1.17 git: date: 2024-05-02 19:28:25 +0000
% 3.62/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.62/1.17 git: non_committed_changes: false
% 3.62/1.17
% 3.62/1.17 ------ Parsing...
% 3.62/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.62/1.17
% 3.62/1.17 ------ 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.62/1.17
% 3.62/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.62/1.17
% 3.62/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.62/1.17 ------ Proving...
% 3.62/1.17 ------ Problem Properties
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17 clauses 76
% 3.62/1.17 conjectures 2
% 3.62/1.17 EPR 9
% 3.62/1.17 Horn 68
% 3.62/1.17 unary 16
% 3.62/1.17 binary 39
% 3.62/1.17 lits 158
% 3.62/1.17 lits eq 15
% 3.62/1.17 fd_pure 0
% 3.62/1.17 fd_pseudo 0
% 3.62/1.17 fd_cond 4
% 3.62/1.17 fd_pseudo_cond 3
% 3.62/1.17 AC symbols 0
% 3.62/1.17
% 3.62/1.17 ------ Schedule dynamic 5 is on
% 3.62/1.17
% 3.62/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17 ------
% 3.62/1.17 Current options:
% 3.62/1.17 ------
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17 ------ Proving...
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17 % SZS status Theorem for theBenchmark.p
% 3.62/1.17
% 3.62/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.62/1.17
% 3.62/1.17
%------------------------------------------------------------------------------