TSTP Solution File: SET626+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET626+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:01:01 EDT 2024
% Result : Theorem 2.38s 1.13s
% Output : CNFRefutation 2.38s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f2,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
fof(f6,conjecture,
! [X0,X1,X2] :
( intersect(X0,intersection(X1,X2))
=> intersect(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th102) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2] :
( intersect(X0,intersection(X1,X2))
=> intersect(X0,X1) ),
inference(negated_conjecture,[],[f6]) ).
fof(f9,plain,
? [X0,X1,X2] :
( ~ intersect(X0,X1)
& intersect(X0,intersection(X1,X2)) ),
inference(ennf_transformation,[],[f7]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f10]) ).
fof(f12,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,[],[f2]) ).
fof(f13,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,[],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
=> ( member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f15,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])],[f13,f14]) ).
fof(f20,plain,
( ? [X0,X1,X2] :
( ~ intersect(X0,X1)
& intersect(X0,intersection(X1,X2)) )
=> ( ~ intersect(sK2,sK3)
& intersect(sK2,intersection(sK3,sK4)) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( ~ intersect(sK2,sK3)
& intersect(sK2,intersection(sK3,sK4)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f9,f20]) ).
fof(f22,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f25,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X0,X1] :
( member(sK0(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
! [X2,X0,X1] :
( intersect(X0,X1)
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f34,plain,
intersect(sK2,intersection(sK3,sK4)),
inference(cnf_transformation,[],[f21]) ).
fof(f35,plain,
~ intersect(sK2,sK3),
inference(cnf_transformation,[],[f21]) ).
cnf(c_51,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_52,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| intersect(X1,X2) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_53,plain,
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,plain,
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_59,negated_conjecture,
~ intersect(sK2,sK3),
inference(cnf_transformation,[],[f35]) ).
cnf(c_60,negated_conjecture,
intersect(sK2,intersection(sK3,sK4)),
inference(cnf_transformation,[],[f34]) ).
cnf(c_166,plain,
intersection(sK3,sK4) = sP0_iProver_def,
definition ).
cnf(c_167,negated_conjecture,
intersect(sK2,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_60,c_166]) ).
cnf(c_386,plain,
( ~ member(X0,sP0_iProver_def)
| member(X0,sK3) ),
inference(superposition,[status(thm)],[c_166,c_51]) ).
cnf(c_438,plain,
( ~ intersect(X0,sP0_iProver_def)
| member(sK0(X0,sP0_iProver_def),sK3) ),
inference(superposition,[status(thm)],[c_53,c_386]) ).
cnf(c_468,plain,
( ~ member(sK0(X0,sP0_iProver_def),X1)
| ~ intersect(X0,sP0_iProver_def)
| intersect(X1,sK3) ),
inference(superposition,[status(thm)],[c_438,c_52]) ).
cnf(c_472,plain,
( ~ member(sK0(sK2,sP0_iProver_def),sK2)
| ~ intersect(sK2,sP0_iProver_def)
| intersect(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_468]) ).
cnf(c_531,plain,
( ~ intersect(sK2,sP0_iProver_def)
| member(sK0(sK2,sP0_iProver_def),sK2) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_532,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_531,c_472,c_167,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET626+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 20:34:40 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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
% 2.38/1.13 % SZS status Started for theBenchmark.p
% 2.38/1.13 % SZS status Theorem for theBenchmark.p
% 2.38/1.13
% 2.38/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.38/1.13
% 2.38/1.13 ------ iProver source info
% 2.38/1.13
% 2.38/1.13 git: date: 2024-05-02 19:28:25 +0000
% 2.38/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.38/1.13 git: non_committed_changes: false
% 2.38/1.13
% 2.38/1.13 ------ Parsing...
% 2.38/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.38/1.13
% 2.38/1.13 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.38/1.13
% 2.38/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.38/1.13
% 2.38/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.38/1.13 ------ Proving...
% 2.38/1.13 ------ Problem Properties
% 2.38/1.13
% 2.38/1.13
% 2.38/1.13 clauses 13
% 2.38/1.13 conjectures 2
% 2.38/1.13 EPR 4
% 2.38/1.13 Horn 12
% 2.38/1.13 unary 4
% 2.38/1.13 binary 5
% 2.38/1.13 lits 26
% 2.38/1.13 lits eq 4
% 2.38/1.13 fd_pure 0
% 2.38/1.13 fd_pseudo 0
% 2.38/1.13 fd_cond 0
% 2.38/1.13 fd_pseudo_cond 2
% 2.38/1.13 AC symbols 0
% 2.38/1.13
% 2.38/1.13 ------ Schedule dynamic 5 is on
% 2.38/1.13
% 2.38/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.38/1.13
% 2.38/1.13
% 2.38/1.13 ------
% 2.38/1.13 Current options:
% 2.38/1.13 ------
% 2.38/1.13
% 2.38/1.13
% 2.38/1.13
% 2.38/1.13
% 2.38/1.13 ------ Proving...
% 2.38/1.13
% 2.38/1.13
% 2.38/1.13 % SZS status Theorem for theBenchmark.p
% 2.38/1.13
% 2.38/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.38/1.13
% 2.38/1.13
%------------------------------------------------------------------------------