TSTP Solution File: SET086+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET086+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:21 EDT 2023
% Result : Theorem 2.05s 1.15s
% Output : CNFRefutation 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 59 ( 35 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 65 ( 27 ~; 17 |; 19 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn; 14 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_set_defn) ).
fof(f44,conjecture,
! [X0] :
? [X2] :
( ( X0 = X2
& ~ ? [X1] :
( singleton(X1) = X0
& member(X1,universal_class) ) )
| ( singleton(X2) = X0
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_of_substitution) ).
fof(f45,negated_conjecture,
~ ! [X0] :
? [X2] :
( ( X0 = X2
& ~ ? [X1] :
( singleton(X1) = X0
& member(X1,universal_class) ) )
| ( singleton(X2) = X0
& member(X2,universal_class) ) ),
inference(negated_conjecture,[],[f44]) ).
fof(f70,plain,
~ ! [X0] :
? [X1] :
( ( X0 = X1
& ~ ? [X2] :
( singleton(X2) = X0
& member(X2,universal_class) ) )
| ( singleton(X1) = X0
& member(X1,universal_class) ) ),
inference(rectify,[],[f45]) ).
fof(f85,plain,
? [X0] :
! [X1] :
( ( X0 != X1
| ? [X2] :
( singleton(X2) = X0
& member(X2,universal_class) ) )
& ( singleton(X1) != X0
| ~ member(X1,universal_class) ) ),
inference(ennf_transformation,[],[f70]) ).
fof(f134,plain,
( ? [X0] :
! [X1] :
( ( X0 != X1
| ? [X2] :
( singleton(X2) = X0
& member(X2,universal_class) ) )
& ( singleton(X1) != X0
| ~ member(X1,universal_class) ) )
=> ! [X1] :
( ( sK6 != X1
| ? [X2] :
( singleton(X2) = sK6
& member(X2,universal_class) ) )
& ( singleton(X1) != sK6
| ~ member(X1,universal_class) ) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X2] :
( singleton(X2) = sK6
& member(X2,universal_class) )
=> ( sK6 = singleton(sK7)
& member(sK7,universal_class) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
! [X1] :
( ( sK6 != X1
| ( sK6 = singleton(sK7)
& member(sK7,universal_class) ) )
& ( singleton(X1) != sK6
| ~ member(X1,universal_class) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f85,f135,f134]) ).
fof(f149,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f224,plain,
! [X1] :
( singleton(X1) != sK6
| ~ member(X1,universal_class) ),
inference(cnf_transformation,[],[f136]) ).
fof(f225,plain,
! [X1] :
( sK6 != X1
| member(sK7,universal_class) ),
inference(cnf_transformation,[],[f136]) ).
fof(f226,plain,
! [X1] :
( sK6 != X1
| sK6 = singleton(sK7) ),
inference(cnf_transformation,[],[f136]) ).
fof(f264,plain,
! [X1] :
( sK6 != X1
| sK6 = unordered_pair(sK7,sK7) ),
inference(definition_unfolding,[],[f226,f149]) ).
fof(f265,plain,
! [X1] :
( sK6 != unordered_pair(X1,X1)
| ~ member(X1,universal_class) ),
inference(definition_unfolding,[],[f224,f149]) ).
fof(f272,plain,
sK6 = unordered_pair(sK7,sK7),
inference(equality_resolution,[],[f264]) ).
fof(f273,plain,
member(sK7,universal_class),
inference(equality_resolution,[],[f225]) ).
cnf(c_128,negated_conjecture,
unordered_pair(sK7,sK7) = sK6,
inference(cnf_transformation,[],[f272]) ).
cnf(c_129,negated_conjecture,
member(sK7,universal_class),
inference(cnf_transformation,[],[f273]) ).
cnf(c_130,negated_conjecture,
( unordered_pair(X0,X0) != sK6
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f265]) ).
cnf(c_2390,plain,
~ member(sK7,universal_class),
inference(superposition,[status(thm)],[c_128,c_130]) ).
cnf(c_2391,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2390,c_129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET086+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 12:10:08 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.05/1.15 % SZS status Started for theBenchmark.p
% 2.05/1.15 % SZS status Theorem for theBenchmark.p
% 2.05/1.15
% 2.05/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.05/1.15
% 2.05/1.15 ------ iProver source info
% 2.05/1.15
% 2.05/1.15 git: date: 2023-05-31 18:12:56 +0000
% 2.05/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.05/1.15 git: non_committed_changes: false
% 2.05/1.15 git: last_make_outside_of_git: false
% 2.05/1.15
% 2.05/1.15 ------ Parsing...
% 2.05/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.05/1.15
% 2.05/1.15 ------ 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.05/1.15
% 2.05/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.05/1.15
% 2.05/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.05/1.15 ------ Proving...
% 2.05/1.15 ------ Problem Properties
% 2.05/1.15
% 2.05/1.15
% 2.05/1.15 clauses 77
% 2.05/1.15 conjectures 3
% 2.05/1.15 EPR 8
% 2.05/1.15 Horn 69
% 2.05/1.15 unary 16
% 2.05/1.15 binary 40
% 2.05/1.15 lits 160
% 2.05/1.15 lits eq 16
% 2.05/1.15 fd_pure 0
% 2.05/1.15 fd_pseudo 0
% 2.05/1.15 fd_cond 4
% 2.05/1.15 fd_pseudo_cond 3
% 2.05/1.15 AC symbols 0
% 2.05/1.15
% 2.05/1.15 ------ Schedule dynamic 5 is on
% 2.05/1.15
% 2.05/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.05/1.15
% 2.05/1.15
% 2.05/1.15 ------
% 2.05/1.15 Current options:
% 2.05/1.15 ------
% 2.05/1.15
% 2.05/1.15
% 2.05/1.15
% 2.05/1.15
% 2.05/1.15 ------ Proving...
% 2.05/1.15
% 2.05/1.15
% 2.05/1.15 % SZS status Theorem for theBenchmark.p
% 2.05/1.15
% 2.05/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.05/1.15
% 2.05/1.15
%------------------------------------------------------------------------------