TSTP Solution File: SEU141+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU141+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:04:39 EDT 2024
% Result : Theorem 4.04s 1.19s
% Output : CNFRefutation 4.04s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f11,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f12,axiom,
! [X0,X1] :
( proper_subset(X0,X1)
<=> ( X0 != X1
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f27,axiom,
! [X0,X1] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f35,axiom,
! [X0] : empty_set = set_intersection2(X0,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_boole) ).
fof(f39,axiom,
! [X0,X1] : subset(set_difference(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t36_xboole_1) ).
fof(f40,axiom,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f41,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t39_xboole_1) ).
fof(f42,axiom,
! [X0] : set_difference(X0,empty_set) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_boole) ).
fof(f45,axiom,
! [X0,X1] : set_difference(X0,X1) = set_difference(set_union2(X0,X1),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t40_xboole_1) ).
fof(f47,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(f50,axiom,
! [X0,X1] :
~ ( proper_subset(X1,X0)
& subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t60_xboole_1) ).
fof(f55,conjecture,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(f56,negated_conjecture,
~ ! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
inference(negated_conjecture,[],[f55]) ).
fof(f65,plain,
! [X0,X1] :
( ( X0 != X1
& subset(X0,X1) )
=> proper_subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f69,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| X0 = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f65]) ).
fof(f70,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| X0 = X1
| ~ subset(X0,X1) ),
inference(flattening,[],[f69]) ).
fof(f73,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f87,plain,
! [X0,X1] :
( ~ proper_subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f50]) ).
fof(f92,plain,
? [X0,X1] :
( disjoint(X0,X1)
<~> set_difference(X0,X1) = X0 ),
inference(ennf_transformation,[],[f56]) ).
fof(f121,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f130,plain,
! [X0,X1] :
( ( empty_set = set_difference(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| empty_set != set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f40]) ).
fof(f135,plain,
? [X0,X1] :
( ( set_difference(X0,X1) != X0
| ~ disjoint(X0,X1) )
& ( set_difference(X0,X1) = X0
| disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f92]) ).
fof(f136,plain,
( ? [X0,X1] :
( ( set_difference(X0,X1) != X0
| ~ disjoint(X0,X1) )
& ( set_difference(X0,X1) = X0
| disjoint(X0,X1) ) )
=> ( ( sK10 != set_difference(sK10,sK11)
| ~ disjoint(sK10,sK11) )
& ( sK10 = set_difference(sK10,sK11)
| disjoint(sK10,sK11) ) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
( ( sK10 != set_difference(sK10,sK11)
| ~ disjoint(sK10,sK11) )
& ( sK10 = set_difference(sK10,sK11)
| disjoint(sK10,sK11) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11])],[f135,f136]) ).
fof(f140,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f168,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f169,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(cnf_transformation,[],[f121]) ).
fof(f170,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f182,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f190,plain,
! [X0] : empty_set = set_intersection2(X0,empty_set),
inference(cnf_transformation,[],[f35]) ).
fof(f195,plain,
! [X0,X1] : subset(set_difference(X0,X1),X0),
inference(cnf_transformation,[],[f39]) ).
fof(f196,plain,
! [X0,X1] :
( subset(X0,X1)
| empty_set != set_difference(X0,X1) ),
inference(cnf_transformation,[],[f130]) ).
fof(f198,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)),
inference(cnf_transformation,[],[f41]) ).
fof(f199,plain,
! [X0] : set_difference(X0,empty_set) = X0,
inference(cnf_transformation,[],[f42]) ).
fof(f204,plain,
! [X0,X1] : set_difference(X0,X1) = set_difference(set_union2(X0,X1),X1),
inference(cnf_transformation,[],[f45]) ).
fof(f206,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
inference(cnf_transformation,[],[f47]) ).
fof(f210,plain,
! [X0,X1] :
( ~ proper_subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f87]) ).
fof(f215,plain,
( sK10 = set_difference(sK10,sK11)
| disjoint(sK10,sK11) ),
inference(cnf_transformation,[],[f137]) ).
fof(f216,plain,
( sK10 != set_difference(sK10,sK11)
| ~ disjoint(sK10,sK11) ),
inference(cnf_transformation,[],[f137]) ).
fof(f226,plain,
! [X0,X1] :
( disjoint(X0,X1)
| empty_set != set_difference(X0,set_difference(X0,X1)) ),
inference(definition_unfolding,[],[f169,f206]) ).
fof(f227,plain,
! [X0,X1] :
( empty_set = set_difference(X0,set_difference(X0,X1))
| ~ disjoint(X0,X1) ),
inference(definition_unfolding,[],[f168,f206]) ).
fof(f233,plain,
! [X0] : empty_set = set_difference(X0,set_difference(X0,empty_set)),
inference(definition_unfolding,[],[f190,f206]) ).
cnf(c_51,plain,
set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f140]) ).
cnf(c_79,plain,
( set_difference(X0,set_difference(X0,X1)) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f226]) ).
cnf(c_80,plain,
( ~ disjoint(X0,X1)
| set_difference(X0,set_difference(X0,X1)) = empty_set ),
inference(cnf_transformation,[],[f227]) ).
cnf(c_81,plain,
( ~ subset(X0,X1)
| X0 = X1
| proper_subset(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
cnf(c_93,plain,
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f182]) ).
cnf(c_101,plain,
set_difference(X0,set_difference(X0,empty_set)) = empty_set,
inference(cnf_transformation,[],[f233]) ).
cnf(c_106,plain,
subset(set_difference(X0,X1),X0),
inference(cnf_transformation,[],[f195]) ).
cnf(c_108,plain,
( set_difference(X0,X1) != empty_set
| subset(X0,X1) ),
inference(cnf_transformation,[],[f196]) ).
cnf(c_109,plain,
set_union2(X0,set_difference(X1,X0)) = set_union2(X0,X1),
inference(cnf_transformation,[],[f198]) ).
cnf(c_110,plain,
set_difference(X0,empty_set) = X0,
inference(cnf_transformation,[],[f199]) ).
cnf(c_115,plain,
set_difference(set_union2(X0,X1),X1) = set_difference(X0,X1),
inference(cnf_transformation,[],[f204]) ).
cnf(c_120,plain,
( ~ proper_subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f210]) ).
cnf(c_125,negated_conjecture,
( set_difference(sK10,sK11) != sK10
| ~ disjoint(sK10,sK11) ),
inference(cnf_transformation,[],[f216]) ).
cnf(c_126,negated_conjecture,
( set_difference(sK10,sK11) = sK10
| disjoint(sK10,sK11) ),
inference(cnf_transformation,[],[f215]) ).
cnf(c_733,plain,
set_difference(X0,X0) = empty_set,
inference(light_normalisation,[status(thm)],[c_101,c_110]) ).
cnf(c_1774,plain,
set_difference(sK10,sK11) = sP0_iProver_def,
definition ).
cnf(c_1775,negated_conjecture,
( sP0_iProver_def = sK10
| disjoint(sK10,sK11) ),
inference(demodulation,[status(thm)],[c_126,c_1774]) ).
cnf(c_1776,negated_conjecture,
( sP0_iProver_def != sK10
| ~ disjoint(sK10,sK11) ),
inference(demodulation,[status(thm)],[c_125]) ).
cnf(c_2979,plain,
subset(sP0_iProver_def,sK10),
inference(superposition,[status(thm)],[c_1774,c_106]) ).
cnf(c_2996,plain,
( sK10 = sP0_iProver_def
| disjoint(sK11,sK10) ),
inference(superposition,[status(thm)],[c_1775,c_93]) ).
cnf(c_3003,plain,
( sK10 = sP0_iProver_def
| disjoint(sK10,sK11) ),
inference(superposition,[status(thm)],[c_2996,c_93]) ).
cnf(c_3132,plain,
set_union2(sK11,sK10) = set_union2(sK11,sP0_iProver_def),
inference(superposition,[status(thm)],[c_1774,c_109]) ).
cnf(c_3234,plain,
set_union2(sK10,sK11) = set_union2(sP0_iProver_def,sK11),
inference(demodulation,[status(thm)],[c_3132,c_51]) ).
cnf(c_3637,plain,
set_difference(set_union2(sP0_iProver_def,sK11),sK11) = set_difference(sK10,sK11),
inference(superposition,[status(thm)],[c_3234,c_115]) ).
cnf(c_3658,plain,
set_difference(set_union2(sP0_iProver_def,sK11),sK11) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_3637,c_1774]) ).
cnf(c_3952,plain,
( sK10 = sP0_iProver_def
| proper_subset(sP0_iProver_def,sK10) ),
inference(superposition,[status(thm)],[c_2979,c_81]) ).
cnf(c_4165,plain,
( set_difference(sK10,sP0_iProver_def) != empty_set
| subset(sK10,sP0_iProver_def) ),
inference(instantiation,[status(thm)],[c_108]) ).
cnf(c_4256,plain,
( ~ subset(sK10,sP0_iProver_def)
| sK10 = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_3952,c_120]) ).
cnf(c_4817,plain,
set_difference(sP0_iProver_def,sK11) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_3658,c_115]) ).
cnf(c_4818,plain,
( set_difference(sP0_iProver_def,sP0_iProver_def) != empty_set
| disjoint(sP0_iProver_def,sK11) ),
inference(superposition,[status(thm)],[c_4817,c_79]) ).
cnf(c_4842,plain,
disjoint(sP0_iProver_def,sK11),
inference(forward_subsumption_resolution,[status(thm)],[c_4818,c_733]) ).
cnf(c_5035,plain,
( set_difference(sK10,set_difference(sK10,sK11)) = empty_set
| sK10 = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_3003,c_80]) ).
cnf(c_5051,plain,
( set_difference(sK10,sP0_iProver_def) = empty_set
| sK10 = sP0_iProver_def ),
inference(light_normalisation,[status(thm)],[c_5035,c_1774]) ).
cnf(c_5328,plain,
sK10 = sP0_iProver_def,
inference(global_subsumption_just,[status(thm)],[c_4256,c_4165,c_4256,c_5051]) ).
cnf(c_5353,plain,
( sP0_iProver_def != sP0_iProver_def
| ~ disjoint(sP0_iProver_def,sK11) ),
inference(demodulation,[status(thm)],[c_1776,c_5328]) ).
cnf(c_5365,plain,
~ disjoint(sP0_iProver_def,sK11),
inference(equality_resolution_simp,[status(thm)],[c_5353]) ).
cnf(c_5366,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5365,c_4842]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU141+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n029.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu May 2 17:53:07 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/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
% 4.04/1.19 % SZS status Started for theBenchmark.p
% 4.04/1.19 % SZS status Theorem for theBenchmark.p
% 4.04/1.19
% 4.04/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.04/1.19
% 4.04/1.19 ------ iProver source info
% 4.04/1.19
% 4.04/1.19 git: date: 2024-05-02 19:28:25 +0000
% 4.04/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.04/1.19 git: non_committed_changes: false
% 4.04/1.19
% 4.04/1.19 ------ Parsing...
% 4.04/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.04/1.19
% 4.04/1.19 ------ Preprocessing... sup_sim: 3 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
% 4.04/1.19
% 4.04/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.04/1.19
% 4.04/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.04/1.19 ------ Proving...
% 4.04/1.19 ------ Problem Properties
% 4.04/1.19
% 4.04/1.19
% 4.04/1.19 clauses 73
% 4.04/1.19 conjectures 2
% 4.04/1.19 EPR 23
% 4.04/1.19 Horn 57
% 4.04/1.19 unary 19
% 4.04/1.19 binary 31
% 4.04/1.19 lits 153
% 4.04/1.19 lits eq 35
% 4.04/1.19 fd_pure 0
% 4.04/1.19 fd_pseudo 0
% 4.04/1.19 fd_cond 3
% 4.04/1.19 fd_pseudo_cond 14
% 4.04/1.19 AC symbols 0
% 4.04/1.19
% 4.04/1.19 ------ Schedule dynamic 5 is on
% 4.04/1.19
% 4.04/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.04/1.19
% 4.04/1.19
% 4.04/1.19 ------
% 4.04/1.19 Current options:
% 4.04/1.19 ------
% 4.04/1.19
% 4.04/1.19
% 4.04/1.19
% 4.04/1.19
% 4.04/1.19 ------ Proving...
% 4.04/1.19
% 4.04/1.19
% 4.04/1.19 % SZS status Theorem for theBenchmark.p
% 4.04/1.19
% 4.04/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.04/1.19
% 4.04/1.19
%------------------------------------------------------------------------------