TSTP Solution File: SET095+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET095+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:51 EDT 2024
% Result : Theorem 0.43s 1.13s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subclass_defn) ).
fof(f4,axiom,
! [X2,X0,X1] :
( member(X2,unordered_pair(X0,X1))
<=> ( ( X1 = X2
| X0 = X2 )
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_defn) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_set_defn) ).
fof(f44,conjecture,
! [X0,X1] :
( member(X0,X1)
=> subclass(singleton(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_singletons2) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] :
( member(X0,X1)
=> subclass(singleton(X0),X1) ),
inference(negated_conjecture,[],[f44]) ).
fof(f46,plain,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) ),
inference(rectify,[],[f4]) ).
fof(f71,plain,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f84,plain,
? [X0,X1] :
( ~ subclass(singleton(X0),X1)
& member(X0,X1) ),
inference(ennf_transformation,[],[f45]) ).
fof(f85,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subclass(X0,X1) ) ),
inference(nnf_transformation,[],[f71]) ).
fof(f86,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(rectify,[],[f85]) ).
fof(f87,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f88,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f86,f87]) ).
fof(f91,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f46]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f91]) ).
fof(f133,plain,
( ? [X0,X1] :
( ~ subclass(singleton(X0),X1)
& member(X0,X1) )
=> ( ~ subclass(singleton(sK6),sK7)
& member(sK6,sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ~ subclass(singleton(sK6),sK7)
& member(sK6,sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f84,f133]) ).
fof(f136,plain,
! [X0,X1] :
( subclass(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f137,plain,
! [X0,X1] :
( subclass(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f88]) ).
fof(f143,plain,
! [X2,X0,X1] :
( X0 = X2
| X0 = X1
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f92]) ).
fof(f147,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f222,plain,
member(sK6,sK7),
inference(cnf_transformation,[],[f134]) ).
fof(f223,plain,
~ subclass(singleton(sK6),sK7),
inference(cnf_transformation,[],[f134]) ).
fof(f261,plain,
~ subclass(unordered_pair(sK6,sK6),sK7),
inference(definition_unfolding,[],[f223,f147]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X1)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f137]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
cnf(c_58,plain,
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[],[f143]) ).
cnf(c_128,negated_conjecture,
~ subclass(unordered_pair(sK6,sK6),sK7),
inference(cnf_transformation,[],[f261]) ).
cnf(c_129,negated_conjecture,
member(sK6,sK7),
inference(cnf_transformation,[],[f222]) ).
cnf(c_1557,plain,
unordered_pair(sK6,sK6) = sP0_iProver_def,
definition ).
cnf(c_1558,negated_conjecture,
member(sK6,sK7),
inference(demodulation,[status(thm)],[c_129]) ).
cnf(c_1559,negated_conjecture,
~ subclass(sP0_iProver_def,sK7),
inference(demodulation,[status(thm)],[c_128,c_1557]) ).
cnf(c_3309,plain,
( ~ member(X0,sP0_iProver_def)
| X0 = sK6 ),
inference(superposition,[status(thm)],[c_1557,c_58]) ).
cnf(c_3679,plain,
( sK0(sP0_iProver_def,X0) = sK6
| subclass(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_50,c_3309]) ).
cnf(c_4633,plain,
sK0(sP0_iProver_def,sK7) = sK6,
inference(superposition,[status(thm)],[c_3679,c_1559]) ).
cnf(c_4645,plain,
( ~ member(sK6,sK7)
| subclass(sP0_iProver_def,sK7) ),
inference(superposition,[status(thm)],[c_4633,c_49]) ).
cnf(c_4649,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4645,c_1559,c_1558]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SET095+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.10/0.32 % Computer : n026.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu May 2 20:47:51 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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
% 0.43/1.13 % SZS status Started for theBenchmark.p
% 0.43/1.13 % SZS status Theorem for theBenchmark.p
% 0.43/1.13
% 0.43/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.43/1.13
% 0.43/1.13 ------ iProver source info
% 0.43/1.13
% 0.43/1.13 git: date: 2024-05-02 19:28:25 +0000
% 0.43/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.43/1.13 git: non_committed_changes: false
% 0.43/1.13
% 0.43/1.13 ------ Parsing...
% 0.43/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.43/1.13
% 0.43/1.13 ------ 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
% 0.43/1.13
% 0.43/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.43/1.13
% 0.43/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.43/1.13 ------ Proving...
% 0.43/1.13 ------ Problem Properties
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 clauses 77
% 0.43/1.13 conjectures 2
% 0.43/1.13 EPR 9
% 0.43/1.13 Horn 69
% 0.43/1.13 unary 17
% 0.43/1.13 binary 39
% 0.43/1.13 lits 159
% 0.43/1.13 lits eq 15
% 0.43/1.13 fd_pure 0
% 0.43/1.13 fd_pseudo 0
% 0.43/1.13 fd_cond 4
% 0.43/1.13 fd_pseudo_cond 3
% 0.43/1.13 AC symbols 0
% 0.43/1.13
% 0.43/1.13 ------ Schedule dynamic 5 is on
% 0.43/1.13
% 0.43/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 ------
% 0.43/1.13 Current options:
% 0.43/1.13 ------
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 ------ Proving...
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 % SZS status Theorem for theBenchmark.p
% 0.43/1.13
% 0.43/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.13
% 0.43/1.13
%------------------------------------------------------------------------------