TSTP Solution File: SET056+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET056+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:34 EDT 2024
% Result : Theorem 3.99s 1.19s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 116 ( 18 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 134 ( 54 ~; 47 |; 27 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 70 ( 0 sgn 45 !; 13 ?)
% 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(f44,conjecture,
! [X0,X1] :
( ? [X6] :
( ~ member(X6,X0)
& member(X6,X1) )
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality1) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] :
( ? [X6] :
( ~ member(X6,X0)
& member(X6,X1) )
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
| X0 = X1 ),
inference(negated_conjecture,[],[f44]) ).
fof(f70,plain,
~ ! [X0,X1] :
( ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) )
| ? [X3] :
( ~ member(X3,X1)
& member(X3,X0) )
| X0 = X1 ),
inference(rectify,[],[f45]) ).
fof(f72,plain,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f85,plain,
? [X0,X1] :
( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
& ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
& X0 != X1 ),
inference(ennf_transformation,[],[f70]) ).
fof(f86,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(f87,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,[],[f86]) ).
fof(f88,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f89,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])],[f87,f88]) ).
fof(f90,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subclass(X1,X0)
| ~ subclass(X0,X1) )
& ( ( subclass(X1,X0)
& subclass(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f91,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subclass(X1,X0)
| ~ subclass(X0,X1) )
& ( ( subclass(X1,X0)
& subclass(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f90]) ).
fof(f134,plain,
( ? [X0,X1] :
( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
& ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
& X0 != X1 )
=> ( ! [X2] :
( member(X2,sK6)
| ~ member(X2,sK7) )
& ! [X3] :
( member(X3,sK7)
| ~ member(X3,sK6) )
& sK6 != sK7 ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ! [X2] :
( member(X2,sK6)
| ~ member(X2,sK7) )
& ! [X3] :
( member(X3,sK7)
| ~ member(X3,sK6) )
& sK6 != sK7 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f85,f134]) ).
fof(f137,plain,
! [X0,X1] :
( subclass(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f89]) ).
fof(f138,plain,
! [X0,X1] :
( subclass(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f89]) ).
fof(f142,plain,
! [X0,X1] :
( X0 = X1
| ~ subclass(X1,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f223,plain,
sK6 != sK7,
inference(cnf_transformation,[],[f135]) ).
fof(f224,plain,
! [X3] :
( member(X3,sK7)
| ~ member(X3,sK6) ),
inference(cnf_transformation,[],[f135]) ).
fof(f225,plain,
! [X2] :
( member(X2,sK6)
| ~ member(X2,sK7) ),
inference(cnf_transformation,[],[f135]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X1)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f138]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f137]) ).
cnf(c_53,plain,
( ~ subclass(X0,X1)
| ~ subclass(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f142]) ).
cnf(c_128,negated_conjecture,
( ~ member(X0,sK7)
| member(X0,sK6) ),
inference(cnf_transformation,[],[f225]) ).
cnf(c_129,negated_conjecture,
( ~ member(X0,sK6)
| member(X0,sK7) ),
inference(cnf_transformation,[],[f224]) ).
cnf(c_130,negated_conjecture,
sK6 != sK7,
inference(cnf_transformation,[],[f223]) ).
cnf(c_2150,negated_conjecture,
sK6 != sK7,
inference(demodulation,[status(thm)],[c_130]) ).
cnf(c_2151,negated_conjecture,
( ~ member(X0,sK6)
| member(X0,sK7) ),
inference(demodulation,[status(thm)],[c_129]) ).
cnf(c_2152,negated_conjecture,
( ~ member(X0,sK7)
| member(X0,sK6) ),
inference(demodulation,[status(thm)],[c_128]) ).
cnf(c_3608,plain,
( member(sK0(sK7,X0),sK6)
| subclass(sK7,X0) ),
inference(superposition,[status(thm)],[c_50,c_2152]) ).
cnf(c_3609,plain,
( member(sK0(sK6,X0),sK7)
| subclass(sK6,X0) ),
inference(superposition,[status(thm)],[c_50,c_2151]) ).
cnf(c_3751,plain,
subclass(sK7,sK6),
inference(superposition,[status(thm)],[c_3608,c_49]) ).
cnf(c_3752,plain,
subclass(sK6,sK7),
inference(superposition,[status(thm)],[c_3609,c_49]) ).
cnf(c_4046,plain,
( ~ subclass(sK7,sK6)
| sK6 = sK7 ),
inference(superposition,[status(thm)],[c_3752,c_53]) ).
cnf(c_4047,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4046,c_2150,c_3751]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET056+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n017.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:05:06 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.49 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.99/1.19 % SZS status Started for theBenchmark.p
% 3.99/1.19 % SZS status Theorem for theBenchmark.p
% 3.99/1.19
% 3.99/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.99/1.19
% 3.99/1.19 ------ iProver source info
% 3.99/1.19
% 3.99/1.19 git: date: 2024-05-02 19:28:25 +0000
% 3.99/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.99/1.19 git: non_committed_changes: false
% 3.99/1.19
% 3.99/1.19 ------ Parsing...
% 3.99/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.99/1.19
% 3.99/1.19 ------ 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.99/1.19
% 3.99/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.99/1.19
% 3.99/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.99/1.19 ------ Proving...
% 3.99/1.19 ------ Problem Properties
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19 clauses 77
% 3.99/1.19 conjectures 3
% 3.99/1.19 EPR 10
% 3.99/1.19 Horn 69
% 3.99/1.19 unary 15
% 3.99/1.19 binary 41
% 3.99/1.19 lits 161
% 3.99/1.19 lits eq 15
% 3.99/1.19 fd_pure 0
% 3.99/1.19 fd_pseudo 0
% 3.99/1.19 fd_cond 4
% 3.99/1.19 fd_pseudo_cond 3
% 3.99/1.19 AC symbols 0
% 3.99/1.19
% 3.99/1.19 ------ Schedule dynamic 5 is on
% 3.99/1.19
% 3.99/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19 ------
% 3.99/1.19 Current options:
% 3.99/1.19 ------
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19 ------ Proving...
% 3.99/1.19
% 3.99/1.19
% 3.99/1.19 % SZS status Theorem for theBenchmark.p
% 3.99/1.19
% 3.99/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.99/1.19
% 3.99/1.19
%------------------------------------------------------------------------------