TSTP Solution File: SET045+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET045+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:31 EDT 2024
% Result : Theorem 1.65s 1.16s
% Output : CNFRefutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 69 ( 31 ~; 24 |; 11 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 42 ( 4 sgn 23 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
? [X1] :
! [X2] :
( element(X2,X1)
<=> ( ~ element(X2,X2)
& element(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel41_1) ).
fof(f2,conjecture,
~ ? [X0] :
! [X2] : element(X2,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel41) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
! [X2] : element(X2,X0),
inference(negated_conjecture,[],[f2]) ).
fof(f4,plain,
~ ~ ? [X0] :
! [X1] : element(X1,X0),
inference(rectify,[],[f3]) ).
fof(f5,plain,
? [X0] :
! [X1] : element(X1,X0),
inference(flattening,[],[f4]) ).
fof(f6,plain,
! [X0] :
? [X1] :
! [X2] :
( ( element(X2,X1)
| element(X2,X2)
| ~ element(X2,X0) )
& ( ( ~ element(X2,X2)
& element(X2,X0) )
| ~ element(X2,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f7,plain,
! [X0] :
? [X1] :
! [X2] :
( ( element(X2,X1)
| element(X2,X2)
| ~ element(X2,X0) )
& ( ( ~ element(X2,X2)
& element(X2,X0) )
| ~ element(X2,X1) ) ),
inference(flattening,[],[f6]) ).
fof(f8,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( element(X2,X1)
| element(X2,X2)
| ~ element(X2,X0) )
& ( ( ~ element(X2,X2)
& element(X2,X0) )
| ~ element(X2,X1) ) )
=> ! [X2] :
( ( element(X2,sK0(X0))
| element(X2,X2)
| ~ element(X2,X0) )
& ( ( ~ element(X2,X2)
& element(X2,X0) )
| ~ element(X2,sK0(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X0,X2] :
( ( element(X2,sK0(X0))
| element(X2,X2)
| ~ element(X2,X0) )
& ( ( ~ element(X2,X2)
& element(X2,X0) )
| ~ element(X2,sK0(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
fof(f10,plain,
( ? [X0] :
! [X1] : element(X1,X0)
=> ! [X1] : element(X1,sK1) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
! [X1] : element(X1,sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f5,f10]) ).
fof(f13,plain,
! [X2,X0] :
( ~ element(X2,X2)
| ~ element(X2,sK0(X0)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
! [X2,X0] :
( element(X2,sK0(X0))
| element(X2,X2)
| ~ element(X2,X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X1] : element(X1,sK1),
inference(cnf_transformation,[],[f11]) ).
cnf(c_49,plain,
( ~ element(X0,X1)
| element(X0,sK0(X1))
| element(X0,X0) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_50,plain,
( ~ element(X0,sK0(X1))
| ~ element(X0,X0) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_52,negated_conjecture,
element(X0,sK1),
inference(cnf_transformation,[],[f15]) ).
cnf(c_71,negated_conjecture,
element(X0,sK1),
inference(demodulation,[status(thm)],[c_52]) ).
cnf(c_74,plain,
( ~ element(sK0(X0),X1)
| element(sK0(X0),sK0(X0))
| element(sK0(X0),sK0(X1)) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_75,plain,
~ element(sK0(X0),sK0(X0)),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_76,plain,
( ~ element(sK0(sK1),sK1)
| element(sK0(sK1),sK0(sK1)) ),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_77,plain,
~ element(sK0(sK1),sK0(sK1)),
inference(instantiation,[status(thm)],[c_75]) ).
cnf(c_86,plain,
element(sK0(X0),sK1),
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_87,plain,
element(sK0(sK1),sK1),
inference(instantiation,[status(thm)],[c_86]) ).
cnf(c_88,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_87,c_77,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET045+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n031.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu May 2 20:55:46 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 1.65/1.16 % SZS status Started for theBenchmark.p
% 1.65/1.16 % SZS status Theorem for theBenchmark.p
% 1.65/1.16
% 1.65/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.65/1.16
% 1.65/1.16 ------ iProver source info
% 1.65/1.16
% 1.65/1.16 git: date: 2024-05-02 19:28:25 +0000
% 1.65/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.65/1.16 git: non_committed_changes: false
% 1.65/1.16
% 1.65/1.16 ------ Parsing...
% 1.65/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.65/1.16
% 1.65/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.65/1.16
% 1.65/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.65/1.16 ------ Proving...
% 1.65/1.16 ------ Problem Properties
% 1.65/1.16
% 1.65/1.16
% 1.65/1.16 clauses 4
% 1.65/1.16 conjectures 1
% 1.65/1.16 EPR 1
% 1.65/1.16 Horn 3
% 1.65/1.16 unary 1
% 1.65/1.16 binary 2
% 1.65/1.16 lits 8
% 1.65/1.16 lits eq 0
% 1.65/1.16 fd_pure 0
% 1.65/1.16 fd_pseudo 0
% 1.65/1.16 fd_cond 0
% 1.65/1.16 fd_pseudo_cond 0
% 1.65/1.16 AC symbols 0
% 1.65/1.16
% 1.65/1.16 ------ Schedule dynamic 5 is on
% 1.65/1.16
% 1.65/1.16 ------ no equalities: superposition off
% 1.65/1.16
% 1.65/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.65/1.16
% 1.65/1.16
% 1.65/1.16 ------
% 1.65/1.16 Current options:
% 1.65/1.16 ------
% 1.65/1.16
% 1.65/1.16
% 1.65/1.16
% 1.65/1.16
% 1.65/1.16 ------ Proving...
% 1.65/1.16
% 1.65/1.16
% 1.65/1.16 % SZS status Theorem for theBenchmark.p
% 1.65/1.16
% 1.65/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.65/1.16
% 1.65/1.16
%------------------------------------------------------------------------------