TSTP Solution File: SET689+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET689+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:09:09 EDT 2023
% Result : Theorem 3.47s 1.18s
% Output : CNFRefutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 12 unt; 0 def)
% Number of atoms : 134 ( 6 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 143 ( 57 ~; 45 |; 31 &)
% ( 3 <=>; 7 =>; 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn; 43 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set) ).
fof(f12,conjecture,
! [X0,X1,X5] :
( ( subset(X5,X0)
& subset(X1,X5)
& subset(X0,X1) )
=> equal_set(X0,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI05) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X5] :
( ( subset(X5,X0)
& subset(X1,X5)
& subset(X0,X1) )
=> equal_set(X0,X5) ),
inference(negated_conjecture,[],[f12]) ).
fof(f23,plain,
~ ! [X0,X1,X2] :
( ( subset(X2,X0)
& subset(X1,X2)
& subset(X0,X1) )
=> equal_set(X0,X2) ),
inference(rectify,[],[f13]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f25,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f26,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f27,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f26]) ).
fof(f29,plain,
? [X0,X1,X2] :
( ~ equal_set(X0,X2)
& subset(X2,X0)
& subset(X1,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f30,plain,
? [X0,X1,X2] :
( ~ equal_set(X0,X2)
& subset(X2,X0)
& subset(X1,X2)
& subset(X0,X1) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f32,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f31]) ).
fof(f33,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f32,f33]) ).
fof(f53,plain,
( ? [X0,X1,X2] :
( ~ equal_set(X0,X2)
& subset(X2,X0)
& subset(X1,X2)
& subset(X0,X1) )
=> ( ~ equal_set(sK3,sK5)
& subset(sK5,sK3)
& subset(sK4,sK5)
& subset(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f54,plain,
( ~ equal_set(sK3,sK5)
& subset(sK5,sK3)
& subset(sK4,sK5)
& subset(sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f30,f53]) ).
fof(f55,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f56,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f57,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f58,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f82,plain,
subset(sK3,sK4),
inference(cnf_transformation,[],[f54]) ).
fof(f83,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f54]) ).
fof(f84,plain,
subset(sK5,sK3),
inference(cnf_transformation,[],[f54]) ).
fof(f85,plain,
~ equal_set(sK3,sK5),
inference(cnf_transformation,[],[f54]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_51,plain,
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_52,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
cnf(c_76,negated_conjecture,
~ equal_set(sK3,sK5),
inference(cnf_transformation,[],[f85]) ).
cnf(c_77,negated_conjecture,
subset(sK5,sK3),
inference(cnf_transformation,[],[f84]) ).
cnf(c_78,negated_conjecture,
subset(sK4,sK5),
inference(cnf_transformation,[],[f83]) ).
cnf(c_79,negated_conjecture,
subset(sK3,sK4),
inference(cnf_transformation,[],[f82]) ).
cnf(c_105,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_49]) ).
cnf(c_109,plain,
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(prop_impl_just,[status(thm)],[c_50]) ).
cnf(c_110,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(renaming,[status(thm)],[c_109]) ).
cnf(c_332,plain,
( X0 != sK3
| X1 != sK5
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(resolution_lifted,[status(thm)],[c_52,c_76]) ).
cnf(c_333,plain,
( ~ subset(sK3,sK5)
| ~ subset(sK5,sK3) ),
inference(unflattening,[status(thm)],[c_332]) ).
cnf(c_334,plain,
~ subset(sK3,sK5),
inference(global_subsumption_just,[status(thm)],[c_333,c_77,c_333]) ).
cnf(c_440,plain,
( X0 != sK3
| X1 != sK5
| member(sK0(X0,X1),X0) ),
inference(resolution_lifted,[status(thm)],[c_110,c_334]) ).
cnf(c_441,plain,
member(sK0(sK3,sK5),sK3),
inference(unflattening,[status(thm)],[c_440]) ).
cnf(c_445,plain,
( X0 != sK3
| X1 != sK5
| ~ member(sK0(X0,X1),X1) ),
inference(resolution_lifted,[status(thm)],[c_105,c_334]) ).
cnf(c_446,plain,
~ member(sK0(sK3,sK5),sK5),
inference(unflattening,[status(thm)],[c_445]) ).
cnf(c_1381,plain,
( ~ member(sK0(sK3,sK5),X0)
| ~ subset(X0,sK5)
| member(sK0(sK3,sK5),sK5) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_1486,plain,
( ~ member(sK0(sK3,sK5),sK4)
| ~ subset(sK4,sK5)
| member(sK0(sK3,sK5),sK5) ),
inference(instantiation,[status(thm)],[c_1381]) ).
cnf(c_1722,plain,
( ~ member(sK0(X0,X1),X0)
| ~ subset(X0,X2)
| member(sK0(X0,X1),X2) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_3940,plain,
( ~ member(sK0(sK3,sK5),sK3)
| ~ subset(sK3,sK4)
| member(sK0(sK3,sK5),sK4) ),
inference(instantiation,[status(thm)],[c_1722]) ).
cnf(c_3941,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3940,c_1486,c_446,c_441,c_78,c_79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET689+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n027.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 10:07:05 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.47/1.18 % SZS status Started for theBenchmark.p
% 3.47/1.18 % SZS status Theorem for theBenchmark.p
% 3.47/1.18
% 3.47/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.47/1.18
% 3.47/1.18 ------ iProver source info
% 3.47/1.18
% 3.47/1.18 git: date: 2023-05-31 18:12:56 +0000
% 3.47/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.47/1.18 git: non_committed_changes: false
% 3.47/1.18 git: last_make_outside_of_git: false
% 3.47/1.18
% 3.47/1.18 ------ Parsing...
% 3.47/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.47/1.18
% 3.47/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.47/1.18
% 3.47/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.47/1.18
% 3.47/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.47/1.18 ------ Proving...
% 3.47/1.18 ------ Problem Properties
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 clauses 30
% 3.47/1.18 conjectures 3
% 3.47/1.18 EPR 6
% 3.47/1.18 Horn 25
% 3.47/1.18 unary 8
% 3.47/1.18 binary 15
% 3.47/1.18 lits 59
% 3.47/1.18 lits eq 3
% 3.47/1.18 fd_pure 0
% 3.47/1.18 fd_pseudo 0
% 3.47/1.18 fd_cond 0
% 3.47/1.18 fd_pseudo_cond 2
% 3.47/1.18 AC symbols 0
% 3.47/1.18
% 3.47/1.18 ------ Input Options Time Limit: Unbounded
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 ------
% 3.47/1.18 Current options:
% 3.47/1.18 ------
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 ------ Proving...
% 3.47/1.18
% 3.47/1.18
% 3.47/1.18 % SZS status Theorem for theBenchmark.p
% 3.47/1.18
% 3.47/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.47/1.18
% 3.47/1.18
%------------------------------------------------------------------------------