TSTP Solution File: SET575+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET575+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:48 EDT 2024
% Result : Theorem 1.72s 1.12s
% Output : CNFRefutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 3 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 75 ( 32 ~; 23 |; 15 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 26 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
fof(f3,conjecture,
! [X0,X1] :
( intersect(X0,X1)
=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th15) ).
fof(f4,negated_conjecture,
~ ! [X0,X1] :
( intersect(X0,X1)
=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f6,plain,
? [X0,X1] :
( ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) )
& intersect(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f7,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(f8,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,[],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
=> ( member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f10,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])],[f8,f9]) ).
fof(f11,plain,
( ? [X0,X1] :
( ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) )
& intersect(X0,X1) )
=> ( ! [X2] :
( ~ member(X2,sK2)
| ~ member(X2,sK1) )
& intersect(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ! [X2] :
( ~ member(X2,sK2)
| ~ member(X2,sK1) )
& intersect(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f6,f11]) ).
fof(f13,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f14,plain,
! [X0,X1] :
( member(sK0(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f17,plain,
intersect(sK1,sK2),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
! [X2] :
( ~ member(X2,sK2)
| ~ member(X2,sK1) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_50,plain,
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_51,plain,
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_53,negated_conjecture,
( ~ member(X0,sK2)
| ~ member(X0,sK1) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_54,negated_conjecture,
intersect(sK1,sK2),
inference(cnf_transformation,[],[f17]) ).
cnf(c_83,negated_conjecture,
( ~ member(X0,sK2)
| ~ member(X0,sK1) ),
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_85,plain,
( ~ intersect(sK1,sK2)
| member(sK0(sK1,sK2),sK2) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_86,plain,
( ~ intersect(sK1,sK2)
| member(sK0(sK1,sK2),sK1) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_92,plain,
( ~ member(sK0(sK1,sK2),sK2)
| ~ member(sK0(sK1,sK2),sK1) ),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_93,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_92,c_86,c_85,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SET575+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n014.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 20:21:02 EDT 2024
% 0.11/0.32 % 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.72/1.12 % SZS status Started for theBenchmark.p
% 1.72/1.12 % SZS status Theorem for theBenchmark.p
% 1.72/1.12
% 1.72/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.72/1.12
% 1.72/1.12 ------ iProver source info
% 1.72/1.12
% 1.72/1.12 git: date: 2024-05-02 19:28:25 +0000
% 1.72/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.72/1.12 git: non_committed_changes: false
% 1.72/1.12
% 1.72/1.12 ------ Parsing...
% 1.72/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.72/1.12
% 1.72/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.72/1.12
% 1.72/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.72/1.12 ------ Proving...
% 1.72/1.12 ------ Problem Properties
% 1.72/1.12
% 1.72/1.12
% 1.72/1.12 clauses 6
% 1.72/1.12 conjectures 2
% 1.72/1.12 EPR 4
% 1.72/1.12 Horn 6
% 1.72/1.12 unary 1
% 1.72/1.12 binary 4
% 1.72/1.12 lits 12
% 1.72/1.12 lits eq 0
% 1.72/1.12 fd_pure 0
% 1.72/1.12 fd_pseudo 0
% 1.72/1.12 fd_cond 0
% 1.72/1.12 fd_pseudo_cond 0
% 1.72/1.12 AC symbols 0
% 1.72/1.12
% 1.72/1.12 ------ Schedule dynamic 5 is on
% 1.72/1.12
% 1.72/1.12 ------ no equalities: superposition off
% 1.72/1.12
% 1.72/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.72/1.12
% 1.72/1.12
% 1.72/1.12 ------
% 1.72/1.12 Current options:
% 1.72/1.12 ------
% 1.72/1.12
% 1.72/1.12
% 1.72/1.12
% 1.72/1.12
% 1.72/1.12 ------ Proving...
% 1.72/1.12
% 1.72/1.12
% 1.72/1.12 % SZS status Theorem for theBenchmark.p
% 1.72/1.12
% 1.72/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.72/1.12
% 1.72/1.12
%------------------------------------------------------------------------------