TSTP Solution File: SET108+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET108+1 : TPTP v8.1.2. Bugfixed v5.4.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 : Thu Aug 31 15:06:34 EDT 2023
% Result : Theorem 2.98s 1.18s
% Output : CNFRefutation 2.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 103 ( 54 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 120 ( 47 ~; 37 |; 34 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn; 34 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_set_defn) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_defn) ).
fof(f44,conjecture,
! [X0] :
? [X2,X3] :
( ( X0 = X3
& X0 = X2
& ~ ? [X1,X4] :
( ordered_pair(X1,X4) = X0
& member(X4,universal_class)
& member(X1,universal_class) ) )
| ( ordered_pair(X2,X3) = X0
& member(X3,universal_class)
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_first_and_second) ).
fof(f45,negated_conjecture,
~ ! [X0] :
? [X2,X3] :
( ( X0 = X3
& X0 = X2
& ~ ? [X1,X4] :
( ordered_pair(X1,X4) = X0
& member(X4,universal_class)
& member(X1,universal_class) ) )
| ( ordered_pair(X2,X3) = X0
& member(X3,universal_class)
& member(X2,universal_class) ) ),
inference(negated_conjecture,[],[f44]) ).
fof(f70,plain,
~ ! [X0] :
? [X1,X2] :
( ( X0 = X2
& X0 = X1
& ~ ? [X3,X4] :
( ordered_pair(X3,X4) = X0
& member(X4,universal_class)
& member(X3,universal_class) ) )
| ( ordered_pair(X1,X2) = X0
& member(X2,universal_class)
& member(X1,universal_class) ) ),
inference(rectify,[],[f45]) ).
fof(f85,plain,
? [X0] :
! [X1,X2] :
( ( X0 != X2
| X0 != X1
| ? [X3,X4] :
( ordered_pair(X3,X4) = X0
& member(X4,universal_class)
& member(X3,universal_class) ) )
& ( ordered_pair(X1,X2) != X0
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ) ),
inference(ennf_transformation,[],[f70]) ).
fof(f134,plain,
( ? [X0] :
! [X1,X2] :
( ( X0 != X2
| X0 != X1
| ? [X3,X4] :
( ordered_pair(X3,X4) = X0
& member(X4,universal_class)
& member(X3,universal_class) ) )
& ( ordered_pair(X1,X2) != X0
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ) )
=> ! [X2,X1] :
( ( sK6 != X2
| sK6 != X1
| ? [X4,X3] :
( ordered_pair(X3,X4) = sK6
& member(X4,universal_class)
& member(X3,universal_class) ) )
& ( ordered_pair(X1,X2) != sK6
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X4,X3] :
( ordered_pair(X3,X4) = sK6
& member(X4,universal_class)
& member(X3,universal_class) )
=> ( sK6 = ordered_pair(sK7,sK8)
& member(sK8,universal_class)
& member(sK7,universal_class) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
! [X1,X2] :
( ( sK6 != X2
| sK6 != X1
| ( sK6 = ordered_pair(sK7,sK8)
& member(sK8,universal_class)
& member(sK7,universal_class) ) )
& ( ordered_pair(X1,X2) != sK6
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f85,f135,f134]) ).
fof(f149,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f150,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
inference(cnf_transformation,[],[f7]) ).
fof(f224,plain,
! [X2,X1] :
( ordered_pair(X1,X2) != sK6
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ),
inference(cnf_transformation,[],[f136]) ).
fof(f225,plain,
! [X2,X1] :
( sK6 != X2
| sK6 != X1
| member(sK7,universal_class) ),
inference(cnf_transformation,[],[f136]) ).
fof(f226,plain,
! [X2,X1] :
( sK6 != X2
| sK6 != X1
| member(sK8,universal_class) ),
inference(cnf_transformation,[],[f136]) ).
fof(f227,plain,
! [X2,X1] :
( sK6 != X2
| sK6 != X1
| sK6 = ordered_pair(sK7,sK8) ),
inference(cnf_transformation,[],[f136]) ).
fof(f228,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f150,f149,f149]) ).
fof(f265,plain,
! [X2,X1] :
( sK6 != X2
| sK6 != X1
| sK6 = unordered_pair(unordered_pair(sK7,sK7),unordered_pair(sK7,unordered_pair(sK8,sK8))) ),
inference(definition_unfolding,[],[f227,f228]) ).
fof(f266,plain,
! [X2,X1] :
( sK6 != unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2)))
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ),
inference(definition_unfolding,[],[f224,f228]) ).
fof(f273,plain,
! [X1] :
( sK6 != X1
| sK6 = unordered_pair(unordered_pair(sK7,sK7),unordered_pair(sK7,unordered_pair(sK8,sK8))) ),
inference(equality_resolution,[],[f265]) ).
fof(f274,plain,
sK6 = unordered_pair(unordered_pair(sK7,sK7),unordered_pair(sK7,unordered_pair(sK8,sK8))),
inference(equality_resolution,[],[f273]) ).
fof(f275,plain,
! [X1] :
( sK6 != X1
| member(sK8,universal_class) ),
inference(equality_resolution,[],[f226]) ).
fof(f276,plain,
member(sK8,universal_class),
inference(equality_resolution,[],[f275]) ).
fof(f277,plain,
! [X1] :
( sK6 != X1
| member(sK7,universal_class) ),
inference(equality_resolution,[],[f225]) ).
fof(f278,plain,
member(sK7,universal_class),
inference(equality_resolution,[],[f277]) ).
cnf(c_128,negated_conjecture,
unordered_pair(unordered_pair(sK7,sK7),unordered_pair(sK7,unordered_pair(sK8,sK8))) = sK6,
inference(cnf_transformation,[],[f274]) ).
cnf(c_129,negated_conjecture,
member(sK8,universal_class),
inference(cnf_transformation,[],[f276]) ).
cnf(c_130,negated_conjecture,
member(sK7,universal_class),
inference(cnf_transformation,[],[f278]) ).
cnf(c_131,negated_conjecture,
( unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))) != sK6
| ~ member(X0,universal_class)
| ~ member(X1,universal_class) ),
inference(cnf_transformation,[],[f266]) ).
cnf(c_2412,plain,
( ~ member(sK7,universal_class)
| ~ member(sK8,universal_class) ),
inference(superposition,[status(thm)],[c_128,c_131]) ).
cnf(c_2413,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2412,c_129,c_130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET108+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.18/0.36 % Computer : n022.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Sat Aug 26 16:21:55 EDT 2023
% 0.18/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.98/1.18 % SZS status Started for theBenchmark.p
% 2.98/1.18 % SZS status Theorem for theBenchmark.p
% 2.98/1.18
% 2.98/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.98/1.18
% 2.98/1.18 ------ iProver source info
% 2.98/1.18
% 2.98/1.18 git: date: 2023-05-31 18:12:56 +0000
% 2.98/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.98/1.18 git: non_committed_changes: false
% 2.98/1.18 git: last_make_outside_of_git: false
% 2.98/1.18
% 2.98/1.18 ------ Parsing...
% 2.98/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.98/1.18
% 2.98/1.18 ------ 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
% 2.98/1.18
% 2.98/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.98/1.18
% 2.98/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.98/1.18 ------ Proving...
% 2.98/1.18 ------ Problem Properties
% 2.98/1.18
% 2.98/1.18
% 2.98/1.18 clauses 78
% 2.98/1.18 conjectures 4
% 2.98/1.18 EPR 9
% 2.98/1.18 Horn 70
% 2.98/1.18 unary 17
% 2.98/1.18 binary 39
% 2.98/1.18 lits 162
% 2.98/1.18 lits eq 16
% 2.98/1.18 fd_pure 0
% 2.98/1.18 fd_pseudo 0
% 2.98/1.18 fd_cond 4
% 2.98/1.18 fd_pseudo_cond 3
% 2.98/1.18 AC symbols 0
% 2.98/1.18
% 2.98/1.18 ------ Schedule dynamic 5 is on
% 2.98/1.18
% 2.98/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.98/1.18
% 2.98/1.18
% 2.98/1.18 ------
% 2.98/1.18 Current options:
% 2.98/1.18 ------
% 2.98/1.18
% 2.98/1.18
% 2.98/1.18
% 2.98/1.18
% 2.98/1.18 ------ Proving...
% 2.98/1.18
% 2.98/1.18
% 2.98/1.18 % SZS status Theorem for theBenchmark.p
% 2.98/1.18
% 2.98/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.98/1.18
% 2.98/1.18
%------------------------------------------------------------------------------