TSTP Solution File: SET047+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET047+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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:05:55 EDT 2023
% Result : Theorem 1.75s 1.15s
% Output : CNFRefutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 1 unt; 0 def)
% Number of atoms : 135 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 164 ( 66 ~; 76 |; 15 &)
% ( 4 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn; 28 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( set_equal(X0,X1)
<=> ! [X2] :
( element(X2,X0)
<=> element(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel43_1) ).
fof(f2,conjecture,
! [X0,X1] :
( set_equal(X0,X1)
<=> set_equal(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel43) ).
fof(f3,negated_conjecture,
~ ! [X0,X1] :
( set_equal(X0,X1)
<=> set_equal(X1,X0) ),
inference(negated_conjecture,[],[f2]) ).
fof(f4,plain,
? [X0,X1] :
( set_equal(X0,X1)
<~> set_equal(X1,X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
! [X0,X1] :
( ( set_equal(X0,X1)
| ? [X2] :
( ( ~ element(X2,X1)
| ~ element(X2,X0) )
& ( element(X2,X1)
| element(X2,X0) ) ) )
& ( ! [X2] :
( ( element(X2,X0)
| ~ element(X2,X1) )
& ( element(X2,X1)
| ~ element(X2,X0) ) )
| ~ set_equal(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f6,plain,
! [X0,X1] :
( ( set_equal(X0,X1)
| ? [X2] :
( ( ~ element(X2,X1)
| ~ element(X2,X0) )
& ( element(X2,X1)
| element(X2,X0) ) ) )
& ( ! [X3] :
( ( element(X3,X0)
| ~ element(X3,X1) )
& ( element(X3,X1)
| ~ element(X3,X0) ) )
| ~ set_equal(X0,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ element(X2,X1)
| ~ element(X2,X0) )
& ( element(X2,X1)
| element(X2,X0) ) )
=> ( ( ~ element(sK0(X0,X1),X1)
| ~ element(sK0(X0,X1),X0) )
& ( element(sK0(X0,X1),X1)
| element(sK0(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X0,X1] :
( ( set_equal(X0,X1)
| ( ( ~ element(sK0(X0,X1),X1)
| ~ element(sK0(X0,X1),X0) )
& ( element(sK0(X0,X1),X1)
| element(sK0(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( element(X3,X0)
| ~ element(X3,X1) )
& ( element(X3,X1)
| ~ element(X3,X0) ) )
| ~ set_equal(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f9,plain,
? [X0,X1] :
( ( ~ set_equal(X1,X0)
| ~ set_equal(X0,X1) )
& ( set_equal(X1,X0)
| set_equal(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f10,plain,
( ? [X0,X1] :
( ( ~ set_equal(X1,X0)
| ~ set_equal(X0,X1) )
& ( set_equal(X1,X0)
| set_equal(X0,X1) ) )
=> ( ( ~ set_equal(sK2,sK1)
| ~ set_equal(sK1,sK2) )
& ( set_equal(sK2,sK1)
| set_equal(sK1,sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( ( ~ set_equal(sK2,sK1)
| ~ set_equal(sK1,sK2) )
& ( set_equal(sK2,sK1)
| set_equal(sK1,sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f9,f10]) ).
fof(f12,plain,
! [X3,X0,X1] :
( element(X3,X1)
| ~ element(X3,X0)
| ~ set_equal(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X3,X0,X1] :
( element(X3,X0)
| ~ element(X3,X1)
| ~ set_equal(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
! [X0,X1] :
( set_equal(X0,X1)
| element(sK0(X0,X1),X1)
| element(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f15,plain,
! [X0,X1] :
( set_equal(X0,X1)
| ~ element(sK0(X0,X1),X1)
| ~ element(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
( set_equal(sK2,sK1)
| set_equal(sK1,sK2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f17,plain,
( ~ set_equal(sK2,sK1)
| ~ set_equal(sK1,sK2) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_49,plain,
( ~ element(sK0(X0,X1),X0)
| ~ element(sK0(X0,X1),X1)
| set_equal(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_50,plain,
( element(sK0(X0,X1),X0)
| element(sK0(X0,X1),X1)
| set_equal(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_51,plain,
( ~ set_equal(X0,X1)
| ~ element(X2,X1)
| element(X2,X0) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_52,plain,
( ~ set_equal(X0,X1)
| ~ element(X2,X0)
| element(X2,X1) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_53,negated_conjecture,
( ~ set_equal(sK2,sK1)
| ~ set_equal(sK1,sK2) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_54,negated_conjecture,
( set_equal(sK2,sK1)
| set_equal(sK1,sK2) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_109,plain,
( ~ element(sK0(sK1,sK2),sK2)
| ~ element(sK0(sK1,sK2),sK1)
| set_equal(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_110,plain,
( element(sK0(sK1,sK2),sK2)
| element(sK0(sK1,sK2),sK1)
| set_equal(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_111,plain,
( element(sK0(sK2,sK1),sK2)
| element(sK0(sK2,sK1),sK1)
| set_equal(sK2,sK1) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_112,plain,
( ~ element(sK0(sK2,sK1),sK2)
| ~ element(sK0(sK2,sK1),sK1)
| set_equal(sK2,sK1) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_113,plain,
( ~ element(sK0(sK2,sK1),sK2)
| ~ set_equal(X0,sK2)
| element(sK0(sK2,sK1),X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_114,plain,
( ~ element(sK0(sK2,sK1),sK2)
| ~ set_equal(sK1,sK2)
| element(sK0(sK2,sK1),sK1) ),
inference(instantiation,[status(thm)],[c_113]) ).
cnf(c_121,plain,
( ~ element(sK0(sK1,sK2),sK2)
| ~ set_equal(sK2,X0)
| element(sK0(sK1,sK2),X0) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_122,plain,
( ~ element(sK0(sK1,sK2),sK2)
| ~ set_equal(sK2,sK1)
| element(sK0(sK1,sK2),sK1) ),
inference(instantiation,[status(thm)],[c_121]) ).
cnf(c_123,plain,
( ~ element(sK0(sK1,sK2),X0)
| ~ set_equal(X1,X0)
| element(sK0(sK1,sK2),X1) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_133,plain,
( ~ element(sK0(sK1,sK2),X0)
| ~ set_equal(sK2,X0)
| element(sK0(sK1,sK2),sK2) ),
inference(instantiation,[status(thm)],[c_123]) ).
cnf(c_134,plain,
( ~ element(sK0(sK1,sK2),sK1)
| ~ set_equal(sK2,sK1)
| element(sK0(sK1,sK2),sK2) ),
inference(instantiation,[status(thm)],[c_133]) ).
cnf(c_144,plain,
( ~ element(sK0(sK2,sK1),sK1)
| ~ set_equal(sK1,X0)
| element(sK0(sK2,sK1),X0) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_150,plain,
( ~ element(sK0(sK2,sK1),sK1)
| ~ set_equal(sK1,sK2)
| element(sK0(sK2,sK1),sK2) ),
inference(instantiation,[status(thm)],[c_144]) ).
cnf(c_160,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_150,c_134,c_122,c_114,c_111,c_112,c_110,c_109,c_53,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET047+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n008.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 13:23:33 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.75/1.15 % SZS status Started for theBenchmark.p
% 1.75/1.15 % SZS status Theorem for theBenchmark.p
% 1.75/1.15
% 1.75/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.75/1.15
% 1.75/1.15 ------ iProver source info
% 1.75/1.15
% 1.75/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.75/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.75/1.15 git: non_committed_changes: false
% 1.75/1.15 git: last_make_outside_of_git: false
% 1.75/1.15
% 1.75/1.15 ------ Parsing...
% 1.75/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.75/1.15
% 1.75/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.75/1.15
% 1.75/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.75/1.15 ------ Proving...
% 1.75/1.15 ------ Problem Properties
% 1.75/1.15
% 1.75/1.15
% 1.75/1.15 clauses 6
% 1.75/1.15 conjectures 2
% 1.75/1.15 EPR 4
% 1.75/1.15 Horn 4
% 1.75/1.15 unary 0
% 1.75/1.15 binary 2
% 1.75/1.15 lits 16
% 1.75/1.15 lits eq 0
% 1.75/1.15 fd_pure 0
% 1.75/1.15 fd_pseudo 0
% 1.75/1.15 fd_cond 0
% 1.75/1.15 fd_pseudo_cond 0
% 1.75/1.15 AC symbols 0
% 1.75/1.15
% 1.75/1.15 ------ Schedule dynamic 5 is on
% 1.75/1.15
% 1.75/1.15 ------ no equalities: superposition off
% 1.75/1.15
% 1.75/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.75/1.15
% 1.75/1.15
% 1.75/1.15 ------
% 1.75/1.15 Current options:
% 1.75/1.15 ------
% 1.75/1.15
% 1.75/1.15
% 1.75/1.15
% 1.75/1.15
% 1.75/1.15 ------ Proving...
% 1.75/1.15
% 1.75/1.15
% 1.75/1.15 % SZS status Theorem for theBenchmark.p
% 1.75/1.15
% 1.75/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.75/1.16
% 1.75/1.16
%------------------------------------------------------------------------------