TSTP Solution File: SET592+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET592+3 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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 : Mon Jun 24 14:34:57 EDT 2024
% Result : Theorem 2.44s 1.11s
% Output : CNFRefutation 2.44s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( subset(X0,empty_set)
=> empty_set = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_of_empty_set_is_empty_set) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_of_subsets) ).
fof(f7,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f11,conjecture,
! [X0,X1,X2] :
( ( empty_set = intersection(X1,X2)
& subset(X0,X2)
& subset(X0,X1) )
=> empty_set = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th51) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2] :
( ( empty_set = intersection(X1,X2)
& subset(X0,X2)
& subset(X0,X1) )
=> empty_set = X0 ),
inference(negated_conjecture,[],[f11]) ).
fof(f13,plain,
! [X0] :
( empty_set = X0
| ~ subset(X0,empty_set) ),
inference(ennf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0,X1,X2] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f15,plain,
! [X0,X1,X2] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f14]) ).
fof(f17,plain,
? [X0,X1,X2] :
( empty_set != X0
& empty_set = intersection(X1,X2)
& subset(X0,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f18,plain,
? [X0,X1,X2] :
( empty_set != X0
& empty_set = intersection(X1,X2)
& subset(X0,X2)
& subset(X0,X1) ),
inference(flattening,[],[f17]) ).
fof(f31,plain,
( ? [X0,X1,X2] :
( empty_set != X0
& empty_set = intersection(X1,X2)
& subset(X0,X2)
& subset(X0,X1) )
=> ( empty_set != sK2
& empty_set = intersection(sK3,sK4)
& subset(sK2,sK4)
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
( empty_set != sK2
& empty_set = intersection(sK3,sK4)
& subset(sK2,sK4)
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f18,f31]) ).
fof(f33,plain,
! [X0] :
( empty_set = X0
| ~ subset(X0,empty_set) ),
inference(cnf_transformation,[],[f13]) ).
fof(f34,plain,
! [X2,X0,X1] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f45,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f7]) ).
fof(f51,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f32]) ).
fof(f52,plain,
subset(sK2,sK4),
inference(cnf_transformation,[],[f32]) ).
fof(f53,plain,
empty_set = intersection(sK3,sK4),
inference(cnf_transformation,[],[f32]) ).
fof(f54,plain,
empty_set != sK2,
inference(cnf_transformation,[],[f32]) ).
cnf(c_49,plain,
( ~ subset(X0,empty_set)
| X0 = empty_set ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_50,plain,
( ~ subset(X0,X1)
| ~ subset(X0,X2)
| subset(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_61,plain,
intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f45]) ).
cnf(c_65,negated_conjecture,
empty_set != sK2,
inference(cnf_transformation,[],[f54]) ).
cnf(c_66,negated_conjecture,
intersection(sK3,sK4) = empty_set,
inference(cnf_transformation,[],[f53]) ).
cnf(c_67,negated_conjecture,
subset(sK2,sK4),
inference(cnf_transformation,[],[f52]) ).
cnf(c_68,negated_conjecture,
subset(sK2,sK3),
inference(cnf_transformation,[],[f51]) ).
cnf(c_337,plain,
intersection(sK3,sK4) = sP0_iProver_def,
definition ).
cnf(c_338,negated_conjecture,
subset(sK2,sK3),
inference(demodulation,[status(thm)],[c_68]) ).
cnf(c_339,negated_conjecture,
subset(sK2,sK4),
inference(demodulation,[status(thm)],[c_67]) ).
cnf(c_340,negated_conjecture,
sP0_iProver_def = empty_set,
inference(demodulation,[status(thm)],[c_66,c_337]) ).
cnf(c_341,negated_conjecture,
empty_set != sK2,
inference(demodulation,[status(thm)],[c_65]) ).
cnf(c_556,plain,
sK2 != sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_341,c_340]) ).
cnf(c_558,plain,
( ~ subset(X0,sP0_iProver_def)
| X0 = sP0_iProver_def ),
inference(light_normalisation,[status(thm)],[c_49,c_340]) ).
cnf(c_724,plain,
( ~ subset(X0,X1)
| ~ subset(X0,X2)
| subset(X0,intersection(X2,X1)) ),
inference(superposition,[status(thm)],[c_61,c_50]) ).
cnf(c_1465,plain,
( ~ subset(X0,sK3)
| ~ subset(X0,sK4)
| subset(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_337,c_724]) ).
cnf(c_1509,plain,
( ~ subset(sK2,sK4)
| subset(sK2,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_338,c_1465]) ).
cnf(c_1515,plain,
subset(sK2,sP0_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_1509,c_339]) ).
cnf(c_1544,plain,
sK2 = sP0_iProver_def,
inference(superposition,[status(thm)],[c_1515,c_558]) ).
cnf(c_1545,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1544,c_556]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET592+3 : TPTP v8.2.0. Released v2.2.0.
% 0.02/0.10 % Command : run_iprover %s %d THM
% 0.09/0.31 % Computer : n024.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Sun Jun 23 14:05:39 EDT 2024
% 0.09/0.31 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.44/1.11 % SZS status Started for theBenchmark.p
% 2.44/1.11 % SZS status Theorem for theBenchmark.p
% 2.44/1.11
% 2.44/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.44/1.11
% 2.44/1.11 ------ iProver source info
% 2.44/1.11
% 2.44/1.11 git: date: 2024-06-12 09:56:46 +0000
% 2.44/1.11 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 2.44/1.11 git: non_committed_changes: false
% 2.44/1.11
% 2.44/1.11 ------ Parsing...
% 2.44/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.44/1.11
% 2.44/1.11 ------ 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.44/1.11
% 2.44/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.44/1.11
% 2.44/1.11 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.44/1.11 ------ Proving...
% 2.44/1.11 ------ Problem Properties
% 2.44/1.11
% 2.44/1.11
% 2.44/1.11 clauses 19
% 2.44/1.11 conjectures 4
% 2.44/1.11 EPR 9
% 2.44/1.11 Horn 17
% 2.44/1.11 unary 8
% 2.44/1.11 binary 5
% 2.44/1.11 lits 36
% 2.44/1.11 lits eq 8
% 2.44/1.11 fd_pure 0
% 2.44/1.11 fd_pseudo 0
% 2.44/1.11 fd_cond 1
% 2.44/1.11 fd_pseudo_cond 3
% 2.44/1.11 AC symbols 0
% 2.44/1.11
% 2.44/1.11 ------ Schedule dynamic 5 is on
% 2.44/1.11
% 2.44/1.11 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.44/1.11
% 2.44/1.11
% 2.44/1.11 ------
% 2.44/1.11 Current options:
% 2.44/1.11 ------
% 2.44/1.11
% 2.44/1.11
% 2.44/1.11
% 2.44/1.11
% 2.44/1.11 ------ Proving...
% 2.44/1.11
% 2.44/1.11
% 2.44/1.11 % SZS status Theorem for theBenchmark.p
% 2.44/1.11
% 2.44/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.44/1.11
% 2.44/1.11
%------------------------------------------------------------------------------