TSTP Solution File: SET573+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET573+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:47 EDT 2024
% Result : Theorem 1.85s 1.21s
% Output : CNFRefutation 1.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 77 ( 29 ~; 20 |; 21 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 30 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
fof(f2,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f4,conjecture,
! [X0,X1,X2] :
( ( disjoint(X1,X2)
& member(X0,X1) )
=> ~ member(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th12) ).
fof(f5,negated_conjecture,
~ ! [X0,X1,X2] :
( ( disjoint(X1,X2)
& member(X0,X1) )
=> ~ member(X0,X2) ),
inference(negated_conjecture,[],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( disjoint(X0,X1)
=> ~ intersect(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f7,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
? [X0,X1,X2] :
( member(X0,X2)
& disjoint(X1,X2)
& member(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f10,plain,
? [X0,X1,X2] :
( member(X0,X2)
& disjoint(X1,X2)
& member(X0,X1) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
| ~ intersect(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f12,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
| ~ intersect(X0,X1) ) ),
inference(rectify,[],[f11]) ).
fof(f13,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
=> ( member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ( member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) )
| ~ intersect(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f13]) ).
fof(f15,plain,
( ? [X0,X1,X2] :
( member(X0,X2)
& disjoint(X1,X2)
& member(X0,X1) )
=> ( member(sK1,sK3)
& disjoint(sK2,sK3)
& member(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( member(sK1,sK3)
& disjoint(sK2,sK3)
& member(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f10,f15]) ).
fof(f19,plain,
! [X2,X0,X1] :
( intersect(X0,X1)
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f20,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f22,plain,
member(sK1,sK2),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
disjoint(sK2,sK3),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
member(sK1,sK3),
inference(cnf_transformation,[],[f16]) ).
cnf(c_49,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| intersect(X1,X2) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_52,plain,
( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_54,negated_conjecture,
member(sK1,sK3),
inference(cnf_transformation,[],[f24]) ).
cnf(c_55,negated_conjecture,
disjoint(sK2,sK3),
inference(cnf_transformation,[],[f23]) ).
cnf(c_56,negated_conjecture,
member(sK1,sK2),
inference(cnf_transformation,[],[f22]) ).
cnf(c_88,plain,
~ intersect(sK2,sK3),
inference(resolution,[status(thm)],[c_52,c_55]) ).
cnf(c_121,plain,
( ~ member(sK1,X0)
| ~ member(sK1,sK2)
| intersect(sK2,X0) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_135,plain,
( ~ member(sK1,sK3)
| ~ member(sK1,sK2)
| intersect(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_121]) ).
cnf(c_136,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_135,c_88,c_54,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET573+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 20:19:27 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 1.85/1.21 % SZS status Started for theBenchmark.p
% 1.85/1.21 % SZS status Theorem for theBenchmark.p
% 1.85/1.21
% 1.85/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.85/1.21
% 1.85/1.21 ------ iProver source info
% 1.85/1.21
% 1.85/1.21 git: date: 2024-05-02 19:28:25 +0000
% 1.85/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.85/1.21 git: non_committed_changes: false
% 1.85/1.21
% 1.85/1.21 ------ Parsing...
% 1.85/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.85/1.21
% 1.85/1.21 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.85/1.21
% 1.85/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.85/1.21 ------ Proving...
% 1.85/1.21 ------ Problem Properties
% 1.85/1.21
% 1.85/1.21
% 1.85/1.21 clauses 7
% 1.85/1.21 conjectures 2
% 1.85/1.21 EPR 5
% 1.85/1.21 Horn 7
% 1.85/1.21 unary 3
% 1.85/1.21 binary 3
% 1.85/1.21 lits 12
% 1.85/1.21 lits eq 0
% 1.85/1.21 fd_pure 0
% 1.85/1.21 fd_pseudo 0
% 1.85/1.21 fd_cond 0
% 1.85/1.21 fd_pseudo_cond 0
% 1.85/1.21 AC symbols 0
% 1.85/1.21
% 1.85/1.21 ------ Schedule dynamic 5 is on
% 1.85/1.21
% 1.85/1.21 ------ no equalities: superposition off
% 1.85/1.21
% 1.85/1.21 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.85/1.21
% 1.85/1.21
% 1.85/1.21 ------
% 1.85/1.21 Current options:
% 1.85/1.21 ------
% 1.85/1.21
% 1.85/1.21
% 1.85/1.21
% 1.85/1.21
% 1.85/1.21 ------ Proving...
% 1.85/1.21
% 1.85/1.21
% 1.85/1.21 % SZS status Theorem for theBenchmark.p
% 1.85/1.21
% 1.85/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.85/1.21
% 1.85/1.21
%------------------------------------------------------------------------------