TSTP Solution File: SET928+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET928+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:02:02 EDT 2024
% Result : Theorem 1.37s 1.11s
% Output : CNFRefutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 51 ( 9 unt; 0 def)
% Number of atoms : 129 ( 42 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 138 ( 60 ~; 56 |; 17 &)
% ( 3 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 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 : 68 ( 3 sgn 36 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f6,axiom,
! [X0,X1,X2] :
~ ( in(X0,X2)
& disjoint(unordered_pair(X0,X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t55_zfmisc_1) ).
fof(f7,axiom,
! [X0,X1,X2] :
~ ( ~ disjoint(unordered_pair(X0,X2),X1)
& ~ in(X2,X1)
& ~ in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t57_zfmisc_1) ).
fof(f8,conjecture,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2)
<=> ( ~ in(X1,X2)
& ~ in(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t72_zfmisc_1) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2] :
( unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2)
<=> ( ~ in(X1,X2)
& ~ in(X0,X2) ) ),
inference(negated_conjecture,[],[f8]) ).
fof(f10,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(f13,plain,
! [X0,X1,X2] :
( ~ in(X0,X2)
| ~ disjoint(unordered_pair(X0,X1),X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f14,plain,
! [X0,X1,X2] :
( disjoint(unordered_pair(X0,X2),X1)
| in(X2,X1)
| in(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f15,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2)
<~> ( ~ in(X1,X2)
& ~ in(X0,X2) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f20,plain,
? [X0,X1,X2] :
( ( in(X1,X2)
| in(X0,X2)
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) )
& ( ( ~ in(X1,X2)
& ~ in(X0,X2) )
| unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f21,plain,
? [X0,X1,X2] :
( ( in(X1,X2)
| in(X0,X2)
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) )
& ( ( ~ in(X1,X2)
& ~ in(X0,X2) )
| unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
( ? [X0,X1,X2] :
( ( in(X1,X2)
| in(X0,X2)
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) )
& ( ( ~ in(X1,X2)
& ~ in(X0,X2) )
| unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2) ) )
=> ( ( in(sK3,sK4)
| in(sK2,sK4)
| unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4) )
& ( ( ~ in(sK3,sK4)
& ~ in(sK2,sK4) )
| unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
( ( in(sK3,sK4)
| in(sK2,sK4)
| unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4) )
& ( ( ~ in(sK3,sK4)
& ~ in(sK2,sK4) )
| unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f21,f22]) ).
fof(f24,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_difference(X0,X1) != X0 )
& ( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f26,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ in(X0,X2)
| ~ disjoint(unordered_pair(X0,X1),X2) ),
inference(cnf_transformation,[],[f13]) ).
fof(f31,plain,
! [X2,X0,X1] :
( disjoint(unordered_pair(X0,X2),X1)
| in(X2,X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f32,plain,
( ~ in(sK2,sK4)
| unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4) ),
inference(cnf_transformation,[],[f23]) ).
fof(f33,plain,
( ~ in(sK3,sK4)
| unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4) ),
inference(cnf_transformation,[],[f23]) ).
fof(f34,plain,
( in(sK3,sK4)
| in(sK2,sK4)
| unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4) ),
inference(cnf_transformation,[],[f23]) ).
fof(f35,plain,
! [X0,X1] :
( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f36,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_difference(X0,X1) != X0 ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_50,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,plain,
( ~ disjoint(unordered_pair(X0,X1),X2)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_55,plain,
( disjoint(unordered_pair(X0,X1),X2)
| in(X0,X2)
| in(X1,X2) ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_56,negated_conjecture,
( set_difference(unordered_pair(sK2,sK3),sK4) != unordered_pair(sK2,sK3)
| in(sK3,sK4)
| in(sK2,sK4) ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_57,negated_conjecture,
( ~ in(sK3,sK4)
| set_difference(unordered_pair(sK2,sK3),sK4) = unordered_pair(sK2,sK3) ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_58,negated_conjecture,
( ~ in(sK2,sK4)
| set_difference(unordered_pair(sK2,sK3),sK4) = unordered_pair(sK2,sK3) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_59,plain,
( set_difference(X0,X1) != X0
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_60,plain,
( ~ disjoint(X0,X1)
| set_difference(X0,X1) = X0 ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_82,plain,
( ~ in(sK3,sK4)
| set_difference(unordered_pair(sK2,sK3),sK4) = unordered_pair(sK2,sK3) ),
inference(prop_impl_just,[status(thm)],[c_57]) ).
cnf(c_84,plain,
( ~ in(sK2,sK4)
| set_difference(unordered_pair(sK2,sK3),sK4) = unordered_pair(sK2,sK3) ),
inference(prop_impl_just,[status(thm)],[c_58]) ).
cnf(c_183,plain,
( ~ in(sK2,sK4)
| set_difference(unordered_pair(sK3,sK2),sK4) = unordered_pair(sK3,sK2) ),
inference(demodulation,[status(thm)],[c_84,c_50]) ).
cnf(c_188,plain,
( ~ in(sK3,sK4)
| set_difference(unordered_pair(sK3,sK2),sK4) = unordered_pair(sK3,sK2) ),
inference(demodulation,[status(thm)],[c_82,c_50]) ).
cnf(c_193,plain,
( set_difference(unordered_pair(sK3,sK2),sK4) != unordered_pair(sK3,sK2)
| in(sK3,sK4)
| in(sK2,sK4) ),
inference(demodulation,[status(thm)],[c_56,c_50]) ).
cnf(c_229,plain,
( ~ in(sK3,sK4)
| set_difference(unordered_pair(sK3,sK2),sK4) = unordered_pair(sK3,sK2) ),
inference(prop_impl_just,[status(thm)],[c_188]) ).
cnf(c_231,plain,
( ~ in(sK2,sK4)
| set_difference(unordered_pair(sK3,sK2),sK4) = unordered_pair(sK3,sK2) ),
inference(prop_impl_just,[status(thm)],[c_183]) ).
cnf(c_644,plain,
( ~ disjoint(unordered_pair(X0,X1),X2)
| ~ in(X1,X2) ),
inference(superposition,[status(thm)],[c_50,c_54]) ).
cnf(c_668,plain,
( set_difference(unordered_pair(X0,X1),X2) = unordered_pair(X0,X1)
| in(X0,X2)
| in(X1,X2) ),
inference(superposition,[status(thm)],[c_55,c_60]) ).
cnf(c_801,plain,
( set_difference(unordered_pair(sK3,sK2),sK4) != unordered_pair(sK3,sK2)
| disjoint(unordered_pair(sK3,sK2),sK4) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_837,plain,
( in(sK3,sK4)
| in(sK2,sK4) ),
inference(backward_subsumption_resolution,[status(thm)],[c_193,c_668]) ).
cnf(c_850,plain,
( set_difference(unordered_pair(sK3,X0),sK4) = unordered_pair(sK3,X0)
| set_difference(unordered_pair(sK3,sK2),sK4) = unordered_pair(sK3,sK2)
| in(X0,sK4) ),
inference(superposition,[status(thm)],[c_668,c_229]) ).
cnf(c_897,plain,
( set_difference(unordered_pair(sK3,sK2),sK4) = unordered_pair(sK3,sK2)
| in(sK2,sK4) ),
inference(instantiation,[status(thm)],[c_850]) ).
cnf(c_909,plain,
( ~ disjoint(unordered_pair(sK3,X0),sK4)
| ~ in(sK3,sK4) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_910,plain,
( ~ disjoint(unordered_pair(sK3,sK2),sK4)
| ~ in(sK3,sK4) ),
inference(instantiation,[status(thm)],[c_909]) ).
cnf(c_913,plain,
in(sK2,sK4),
inference(global_subsumption_just,[status(thm)],[c_193,c_801,c_837,c_897,c_910]) ).
cnf(c_915,plain,
in(sK2,sK4),
inference(global_subsumption_just,[status(thm)],[c_837,c_913]) ).
cnf(c_917,plain,
set_difference(unordered_pair(sK3,sK2),sK4) = unordered_pair(sK3,sK2),
inference(backward_subsumption_resolution,[status(thm)],[c_231,c_915]) ).
cnf(c_958,plain,
disjoint(unordered_pair(sK3,sK2),sK4),
inference(superposition,[status(thm)],[c_917,c_59]) ).
cnf(c_1023,plain,
~ in(sK2,sK4),
inference(superposition,[status(thm)],[c_958,c_644]) ).
cnf(c_1025,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1023,c_915]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SET928+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.10 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n013.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 20:26:04 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 1.37/1.11 % SZS status Started for theBenchmark.p
% 1.37/1.11 % SZS status Theorem for theBenchmark.p
% 1.37/1.11
% 1.37/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.37/1.11
% 1.37/1.11 ------ iProver source info
% 1.37/1.11
% 1.37/1.11 git: date: 2024-05-02 19:28:25 +0000
% 1.37/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.37/1.11 git: non_committed_changes: false
% 1.37/1.11
% 1.37/1.11 ------ Parsing...
% 1.37/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.37/1.11
% 1.37/1.11 ------ Preprocessing... sup_sim: 3 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
% 1.37/1.11
% 1.37/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.37/1.11
% 1.37/1.11 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.37/1.11 ------ Proving...
% 1.37/1.11 ------ Problem Properties
% 1.37/1.11
% 1.37/1.11
% 1.37/1.11 clauses 11
% 1.37/1.11 conjectures 0
% 1.37/1.11 EPR 3
% 1.37/1.11 Horn 9
% 1.37/1.11 unary 2
% 1.37/1.11 binary 7
% 1.37/1.11 lits 22
% 1.37/1.11 lits eq 7
% 1.37/1.11 fd_pure 0
% 1.37/1.11 fd_pseudo 0
% 1.37/1.11 fd_cond 0
% 1.37/1.11 fd_pseudo_cond 0
% 1.37/1.11 AC symbols 0
% 1.37/1.11
% 1.37/1.11 ------ Schedule dynamic 5 is on
% 1.37/1.11
% 1.37/1.11 ------ no conjectures: strip conj schedule
% 1.37/1.11
% 1.37/1.11 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.37/1.11
% 1.37/1.11
% 1.37/1.11 ------
% 1.37/1.11 Current options:
% 1.37/1.11 ------
% 1.37/1.11
% 1.37/1.11
% 1.37/1.11
% 1.37/1.11
% 1.37/1.11 ------ Proving...
% 1.37/1.11
% 1.37/1.11
% 1.37/1.11 % SZS status Theorem for theBenchmark.p
% 1.37/1.11
% 1.37/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.37/1.11
% 1.37/1.11
%------------------------------------------------------------------------------