TSTP Solution File: SEU141+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU141+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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 17:04:01 EDT 2023
% Result : Theorem 3.27s 1.15s
% Output : CNFRefutation 3.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 17 unt; 0 def)
% Number of atoms : 105 ( 52 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 95 ( 38 ~; 39 |; 11 &)
% ( 5 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 62 ( 1 sgn; 43 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_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(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(f42,axiom,
! [X0] : set_difference(X0,empty_set) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_boole) ).
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(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(f92,plain,
? [X0,X1] :
( disjoint(X0,X1)
<~> set_difference(X0,X1) = X0 ),
inference(ennf_transformation,[],[f56]) ).
fof(f96,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f97,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f96]) ).
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(f144,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
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(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(f199,plain,
! [X0] : set_difference(X0,empty_set) = X0,
inference(cnf_transformation,[],[f42]) ).
fof(f206,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
inference(cnf_transformation,[],[f47]) ).
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_53,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f144]) ).
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_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_110,plain,
set_difference(X0,empty_set) = X0,
inference(cnf_transformation,[],[f199]) ).
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_3645,plain,
( ~ subset(set_difference(sK10,sK11),sK10)
| ~ subset(sK10,set_difference(sK10,sK11))
| set_difference(sK10,sK11) = sK10 ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_4466,plain,
subset(set_difference(sK10,sK11),sK10),
inference(instantiation,[status(thm)],[c_106]) ).
cnf(c_5594,plain,
( set_difference(sK10,set_difference(sK10,sK11)) = empty_set
| set_difference(sK10,sK11) = sK10 ),
inference(superposition,[status(thm)],[c_126,c_80]) ).
cnf(c_6043,plain,
( set_difference(sK10,sK11) = sK10
| subset(sK10,set_difference(sK10,sK11)) ),
inference(superposition,[status(thm)],[c_5594,c_108]) ).
cnf(c_6129,plain,
set_difference(sK10,sK11) = sK10,
inference(global_subsumption_just,[status(thm)],[c_6043,c_3645,c_4466,c_6043]) ).
cnf(c_6139,plain,
( set_difference(sK10,sK10) != empty_set
| disjoint(sK10,sK11) ),
inference(superposition,[status(thm)],[c_6129,c_79]) ).
cnf(c_6183,plain,
disjoint(sK10,sK11),
inference(forward_subsumption_resolution,[status(thm)],[c_6139,c_733]) ).
cnf(c_6184,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_6183,c_6129,c_125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU141+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n016.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 : Wed Aug 23 14:21:07 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.27/1.15 % SZS status Started for theBenchmark.p
% 3.27/1.15 % SZS status Theorem for theBenchmark.p
% 3.27/1.15
% 3.27/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.27/1.15
% 3.27/1.15 ------ iProver source info
% 3.27/1.15
% 3.27/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.27/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.27/1.15 git: non_committed_changes: false
% 3.27/1.15 git: last_make_outside_of_git: false
% 3.27/1.15
% 3.27/1.15 ------ Parsing...
% 3.27/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.27/1.15
% 3.27/1.15 ------ 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
% 3.27/1.15
% 3.27/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.27/1.15
% 3.27/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.27/1.15 ------ Proving...
% 3.27/1.15 ------ Problem Properties
% 3.27/1.15
% 3.27/1.15
% 3.27/1.15 clauses 72
% 3.27/1.15 conjectures 2
% 3.27/1.15 EPR 21
% 3.27/1.15 Horn 56
% 3.27/1.15 unary 18
% 3.27/1.15 binary 31
% 3.27/1.15 lits 152
% 3.27/1.15 lits eq 34
% 3.27/1.15 fd_pure 0
% 3.27/1.15 fd_pseudo 0
% 3.27/1.15 fd_cond 3
% 3.27/1.15 fd_pseudo_cond 14
% 3.27/1.15 AC symbols 0
% 3.27/1.15
% 3.27/1.15 ------ Schedule dynamic 5 is on
% 3.27/1.15
% 3.27/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.27/1.15
% 3.27/1.15
% 3.27/1.15 ------
% 3.27/1.15 Current options:
% 3.27/1.15 ------
% 3.27/1.15
% 3.27/1.15
% 3.27/1.15
% 3.27/1.15
% 3.27/1.15 ------ Proving...
% 3.27/1.15
% 3.27/1.15
% 3.27/1.15 % SZS status Theorem for theBenchmark.p
% 3.27/1.15
% 3.27/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.27/1.15
% 3.27/1.15
%------------------------------------------------------------------------------