TSTP Solution File: SET183+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET183+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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 03:00:12 EDT 2024
% Result : Theorem 2.92s 1.15s
% Output : CNFRefutation 2.92s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f5,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f7,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_member_defn) ).
fof(f8,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subset_intersection) ).
fof(f9,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
inference(negated_conjecture,[],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
? [X0,X1] :
( intersection(X0,X1) != X0
& subset(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f12]) ).
fof(f14,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,[],[f10]) ).
fof(f15,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,[],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f17,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])],[f15,f16]) ).
fof(f20,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X2] :
( ( member(X2,X0)
| ~ member(X2,X1) )
& ( member(X2,X1)
| ~ member(X2,X0) ) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f21,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(rectify,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) )
=> ( ( ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) )
& ( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0,X1] :
( ( X0 = X1
| ( ( ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) )
& ( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f21,f22]) ).
fof(f24,plain,
( ? [X0,X1] :
( intersection(X0,X1) != X0
& subset(X0,X1) )
=> ( sK2 != intersection(sK2,sK3)
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
( sK2 != intersection(sK2,sK3)
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f11,f24]) ).
fof(f26,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f28,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f30,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f36,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f40,plain,
! [X0,X1] :
( X0 = X1
| member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f41,plain,
! [X0,X1] :
( X0 = X1
| ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f42,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f25]) ).
fof(f43,plain,
sK2 != intersection(sK2,sK3),
inference(cnf_transformation,[],[f25]) ).
cnf(c_49,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_51,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_55,plain,
( ~ member(X0,X1)
| ~ subset(X1,X2)
| member(X0,X2) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_59,plain,
intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f36]) ).
cnf(c_61,plain,
( ~ member(sK1(X0,X1),X0)
| ~ member(sK1(X0,X1),X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_62,plain,
( X0 = X1
| member(sK1(X0,X1),X0)
| member(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_63,negated_conjecture,
intersection(sK2,sK3) != sK2,
inference(cnf_transformation,[],[f43]) ).
cnf(c_64,negated_conjecture,
subset(sK2,sK3),
inference(cnf_transformation,[],[f42]) ).
cnf(c_285,plain,
intersection(sK2,sK3) = sP0_iProver_def,
definition ).
cnf(c_286,negated_conjecture,
subset(sK2,sK3),
inference(demodulation,[status(thm)],[c_64]) ).
cnf(c_287,negated_conjecture,
sP0_iProver_def != sK2,
inference(demodulation,[status(thm)],[c_63,c_285]) ).
cnf(c_288,plain,
X0 = X0,
theory(equality) ).
cnf(c_290,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_502,plain,
( ~ member(X0,sP0_iProver_def)
| member(X0,sK2) ),
inference(superposition,[status(thm)],[c_285,c_51]) ).
cnf(c_621,plain,
( sK2 != X0
| sP0_iProver_def != X0
| sP0_iProver_def = sK2 ),
inference(instantiation,[status(thm)],[c_290]) ).
cnf(c_703,plain,
( sK2 != sP0_iProver_def
| sP0_iProver_def != sP0_iProver_def
| sP0_iProver_def = sK2 ),
inference(instantiation,[status(thm)],[c_621]) ).
cnf(c_704,plain,
sP0_iProver_def = sP0_iProver_def,
inference(instantiation,[status(thm)],[c_288]) ).
cnf(c_712,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X2,X1)) ),
inference(superposition,[status(thm)],[c_59,c_49]) ).
cnf(c_737,plain,
( X0 = sP0_iProver_def
| member(sK1(X0,sP0_iProver_def),X0)
| member(sK1(X0,sP0_iProver_def),sK2) ),
inference(superposition,[status(thm)],[c_62,c_502]) ).
cnf(c_781,plain,
( sK2 = sP0_iProver_def
| member(sK1(sK2,sP0_iProver_def),sK2) ),
inference(instantiation,[status(thm)],[c_737]) ).
cnf(c_824,plain,
( ~ member(sK1(sK2,sP0_iProver_def),sK2)
| ~ member(sK1(sK2,sP0_iProver_def),sP0_iProver_def)
| sK2 = sP0_iProver_def ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_1289,plain,
( ~ member(X0,sK2)
| ~ member(X0,sK3)
| member(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_285,c_712]) ).
cnf(c_1482,plain,
( sK2 = sP0_iProver_def
| member(sK1(sK2,sP0_iProver_def),sK2) ),
inference(equality_factoring,[status(thm)],[c_737]) ).
cnf(c_1521,plain,
member(sK1(sK2,sP0_iProver_def),sK2),
inference(global_subsumption_just,[status(thm)],[c_1482,c_287,c_703,c_704,c_781]) ).
cnf(c_1523,plain,
( ~ subset(sK2,X0)
| member(sK1(sK2,sP0_iProver_def),X0) ),
inference(superposition,[status(thm)],[c_1521,c_55]) ).
cnf(c_1543,plain,
( ~ member(sK1(sK2,sP0_iProver_def),sK2)
| ~ subset(sK2,sK3)
| member(sK1(sK2,sP0_iProver_def),sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_1523,c_1289]) ).
cnf(c_1552,plain,
member(sK1(sK2,sP0_iProver_def),sP0_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_1543,c_286,c_1521]) ).
cnf(c_1553,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1552,c_824,c_781,c_704,c_703,c_287]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET183+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu May 2 20:30:11 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 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
% 2.92/1.15 % SZS status Started for theBenchmark.p
% 2.92/1.15 % SZS status Theorem for theBenchmark.p
% 2.92/1.15
% 2.92/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.92/1.15
% 2.92/1.15 ------ iProver source info
% 2.92/1.15
% 2.92/1.15 git: date: 2024-05-02 19:28:25 +0000
% 2.92/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.92/1.15 git: non_committed_changes: false
% 2.92/1.15
% 2.92/1.15 ------ Parsing...
% 2.92/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.92/1.15
% 2.92/1.15 ------ 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
% 2.92/1.15
% 2.92/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.92/1.15
% 2.92/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.92/1.15 ------ Proving...
% 2.92/1.15 ------ Problem Properties
% 2.92/1.15
% 2.92/1.15
% 2.92/1.15 clauses 15
% 2.92/1.15 conjectures 2
% 2.92/1.15 EPR 5
% 2.92/1.15 Horn 13
% 2.92/1.15 unary 6
% 2.92/1.15 binary 4
% 2.92/1.15 lits 29
% 2.92/1.15 lits eq 6
% 2.92/1.15 fd_pure 0
% 2.92/1.15 fd_pseudo 0
% 2.92/1.15 fd_cond 0
% 2.92/1.15 fd_pseudo_cond 3
% 2.92/1.15 AC symbols 0
% 2.92/1.15
% 2.92/1.15 ------ Schedule dynamic 5 is on
% 2.92/1.15
% 2.92/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.92/1.15
% 2.92/1.15
% 2.92/1.15 ------
% 2.92/1.15 Current options:
% 2.92/1.15 ------
% 2.92/1.15
% 2.92/1.15
% 2.92/1.15
% 2.92/1.15
% 2.92/1.15 ------ Proving...
% 2.92/1.15
% 2.92/1.15
% 2.92/1.15 % SZS status Theorem for theBenchmark.p
% 2.92/1.15
% 2.92/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.92/1.15
% 2.92/1.15
%------------------------------------------------------------------------------