TSTP Solution File: SET060+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET060+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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 02:59:35 EDT 2024
% Result : Theorem 3.28s 1.21s
% Output : CNFRefutation 3.28s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f13,axiom,
! [X0,X1,X4] :
( member(X4,intersection(X0,X1))
<=> ( member(X4,X1)
& member(X4,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection) ).
fof(f14,axiom,
! [X0,X4] :
( member(X4,complement(X0))
<=> ( ~ member(X4,X0)
& member(X4,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement) ).
fof(f44,conjecture,
! [X0,X1] : ~ member(X1,intersection(complement(X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',special_classes_lemma) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] : ~ member(X1,intersection(complement(X0),X0)),
inference(negated_conjecture,[],[f44]) ).
fof(f49,plain,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
inference(rectify,[],[f13]) ).
fof(f50,plain,
! [X0,X1] :
( member(X1,complement(X0))
<=> ( ~ member(X1,X0)
& member(X1,universal_class) ) ),
inference(rectify,[],[f14]) ).
fof(f84,plain,
? [X0,X1] : member(X1,intersection(complement(X0),X0)),
inference(ennf_transformation,[],[f45]) ).
fof(f97,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,[],[f49]) ).
fof(f98,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,[],[f97]) ).
fof(f99,plain,
! [X0,X1] :
( ( member(X1,complement(X0))
| member(X1,X0)
| ~ member(X1,universal_class) )
& ( ( ~ member(X1,X0)
& member(X1,universal_class) )
| ~ member(X1,complement(X0)) ) ),
inference(nnf_transformation,[],[f50]) ).
fof(f100,plain,
! [X0,X1] :
( ( member(X1,complement(X0))
| member(X1,X0)
| ~ member(X1,universal_class) )
& ( ( ~ member(X1,X0)
& member(X1,universal_class) )
| ~ member(X1,complement(X0)) ) ),
inference(flattening,[],[f99]) ).
fof(f133,plain,
( ? [X0,X1] : member(X1,intersection(complement(X0),X0))
=> member(sK7,intersection(complement(sK6),sK6)) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
member(sK7,intersection(complement(sK6),sK6)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f84,f133]) ).
fof(f159,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f98]) ).
fof(f160,plain,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f98]) ).
fof(f163,plain,
! [X0,X1] :
( ~ member(X1,X0)
| ~ member(X1,complement(X0)) ),
inference(cnf_transformation,[],[f100]) ).
fof(f222,plain,
member(sK7,intersection(complement(sK6),sK6)),
inference(cnf_transformation,[],[f134]) ).
cnf(c_72,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f160]) ).
cnf(c_73,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f159]) ).
cnf(c_75,plain,
( ~ member(X0,complement(X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f163]) ).
cnf(c_128,negated_conjecture,
member(sK7,intersection(complement(sK6),sK6)),
inference(cnf_transformation,[],[f222]) ).
cnf(c_1554,plain,
complement(sK6) = sP0_iProver_def,
definition ).
cnf(c_1555,plain,
intersection(sP0_iProver_def,sK6) = sP1_iProver_def,
definition ).
cnf(c_1556,negated_conjecture,
member(sK7,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_128,c_1554,c_1555]) ).
cnf(c_2510,plain,
( ~ member(X0,sP1_iProver_def)
| member(X0,sK6) ),
inference(superposition,[status(thm)],[c_1555,c_72]) ).
cnf(c_2526,plain,
member(sK7,sK6),
inference(superposition,[status(thm)],[c_1556,c_2510]) ).
cnf(c_2547,plain,
( ~ member(X0,sP1_iProver_def)
| member(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_1555,c_73]) ).
cnf(c_2561,plain,
member(sK7,sP0_iProver_def),
inference(superposition,[status(thm)],[c_1556,c_2547]) ).
cnf(c_2573,plain,
( ~ member(X0,sK6)
| ~ member(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_1554,c_75]) ).
cnf(c_2682,plain,
~ member(sK7,sK6),
inference(superposition,[status(thm)],[c_2561,c_2573]) ).
cnf(c_2683,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2682,c_2526]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET060+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n018.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 : Thu May 2 20:27:16 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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
% 3.28/1.21 % SZS status Started for theBenchmark.p
% 3.28/1.21 % SZS status Theorem for theBenchmark.p
% 3.28/1.21
% 3.28/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.28/1.21
% 3.28/1.21 ------ iProver source info
% 3.28/1.21
% 3.28/1.21 git: date: 2024-05-02 19:28:25 +0000
% 3.28/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.28/1.21 git: non_committed_changes: false
% 3.28/1.21
% 3.28/1.21 ------ Parsing...
% 3.28/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.28/1.21
% 3.28/1.21 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 3.28/1.21
% 3.28/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.28/1.21
% 3.28/1.21 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.28/1.21 ------ Proving...
% 3.28/1.21 ------ Problem Properties
% 3.28/1.21
% 3.28/1.21
% 3.28/1.21 clauses 77
% 3.28/1.21 conjectures 1
% 3.28/1.21 EPR 8
% 3.28/1.21 Horn 69
% 3.28/1.21 unary 17
% 3.28/1.21 binary 39
% 3.28/1.21 lits 159
% 3.28/1.21 lits eq 16
% 3.28/1.21 fd_pure 0
% 3.28/1.21 fd_pseudo 0
% 3.28/1.21 fd_cond 4
% 3.28/1.21 fd_pseudo_cond 3
% 3.28/1.21 AC symbols 0
% 3.28/1.21
% 3.28/1.21 ------ Schedule dynamic 5 is on
% 3.28/1.21
% 3.28/1.21 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.28/1.21
% 3.28/1.21
% 3.28/1.21 ------
% 3.28/1.21 Current options:
% 3.28/1.21 ------
% 3.28/1.21
% 3.28/1.21
% 3.28/1.21
% 3.28/1.21
% 3.28/1.21 ------ Proving...
% 3.28/1.21
% 3.28/1.21
% 3.28/1.21 % SZS status Theorem for theBenchmark.p
% 3.28/1.21
% 3.28/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.28/1.21
% 3.28/1.21
%------------------------------------------------------------------------------