TSTP Solution File: GEO082+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO082+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 : Wed Aug 30 23:09:15 EDT 2023
% Result : Theorem 3.62s 1.16s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 7 unt; 0 def)
% Number of atoms : 119 ( 20 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 129 ( 47 ~; 45 |; 25 &)
% ( 3 <=>; 8 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn; 41 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( part_of(X1,X0)
<=> ! [X2] :
( incident_c(X2,X1)
=> incident_c(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',part_of_defn) ).
fof(f16,axiom,
! [X0,X1] :
( ! [X2] :
( incident_c(X2,X0)
<=> incident_c(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c9) ).
fof(f17,conjecture,
! [X1,X3] :
( ( part_of(X3,X1)
& part_of(X1,X3) )
=> X1 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',part_of_antisymmetry) ).
fof(f18,negated_conjecture,
~ ! [X1,X3] :
( ( part_of(X3,X1)
& part_of(X1,X3) )
=> X1 = X3 ),
inference(negated_conjecture,[],[f17]) ).
fof(f32,plain,
~ ! [X0,X1] :
( ( part_of(X1,X0)
& part_of(X0,X1) )
=> X0 = X1 ),
inference(rectify,[],[f18]) ).
fof(f35,plain,
! [X0,X1] :
( part_of(X1,X0)
<=> ! [X2] :
( incident_c(X2,X0)
| ~ incident_c(X2,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f53,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( incident_c(X2,X0)
<~> incident_c(X2,X1) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f54,plain,
? [X0,X1] :
( X0 != X1
& part_of(X1,X0)
& part_of(X0,X1) ),
inference(ennf_transformation,[],[f32]) ).
fof(f55,plain,
? [X0,X1] :
( X0 != X1
& part_of(X1,X0)
& part_of(X0,X1) ),
inference(flattening,[],[f54]) ).
fof(f56,plain,
! [X0,X1] :
( ( part_of(X1,X0)
| ? [X2] :
( ~ incident_c(X2,X0)
& incident_c(X2,X1) ) )
& ( ! [X2] :
( incident_c(X2,X0)
| ~ incident_c(X2,X1) )
| ~ part_of(X1,X0) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f57,plain,
! [X0,X1] :
( ( part_of(X1,X0)
| ? [X2] :
( ~ incident_c(X2,X0)
& incident_c(X2,X1) ) )
& ( ! [X3] :
( incident_c(X3,X0)
| ~ incident_c(X3,X1) )
| ~ part_of(X1,X0) ) ),
inference(rectify,[],[f56]) ).
fof(f58,plain,
! [X0,X1] :
( ? [X2] :
( ~ incident_c(X2,X0)
& incident_c(X2,X1) )
=> ( ~ incident_c(sK0(X0,X1),X0)
& incident_c(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f59,plain,
! [X0,X1] :
( ( part_of(X1,X0)
| ( ~ incident_c(sK0(X0,X1),X0)
& incident_c(sK0(X0,X1),X1) ) )
& ( ! [X3] :
( incident_c(X3,X0)
| ~ incident_c(X3,X1) )
| ~ part_of(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f57,f58]) ).
fof(f90,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ incident_c(X2,X1)
| ~ incident_c(X2,X0) )
& ( incident_c(X2,X1)
| incident_c(X2,X0) ) ) ),
inference(nnf_transformation,[],[f53]) ).
fof(f91,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ incident_c(X2,X1)
| ~ incident_c(X2,X0) )
& ( incident_c(X2,X1)
| incident_c(X2,X0) ) )
=> ( ( ~ incident_c(sK12(X0,X1),X1)
| ~ incident_c(sK12(X0,X1),X0) )
& ( incident_c(sK12(X0,X1),X1)
| incident_c(sK12(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f92,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ incident_c(sK12(X0,X1),X1)
| ~ incident_c(sK12(X0,X1),X0) )
& ( incident_c(sK12(X0,X1),X1)
| incident_c(sK12(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f90,f91]) ).
fof(f93,plain,
( ? [X0,X1] :
( X0 != X1
& part_of(X1,X0)
& part_of(X0,X1) )
=> ( sK13 != sK14
& part_of(sK14,sK13)
& part_of(sK13,sK14) ) ),
introduced(choice_axiom,[]) ).
fof(f94,plain,
( sK13 != sK14
& part_of(sK14,sK13)
& part_of(sK13,sK14) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f55,f93]) ).
fof(f95,plain,
! [X3,X0,X1] :
( incident_c(X3,X0)
| ~ incident_c(X3,X1)
| ~ part_of(X1,X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f134,plain,
! [X0,X1] :
( X0 = X1
| incident_c(sK12(X0,X1),X1)
| incident_c(sK12(X0,X1),X0) ),
inference(cnf_transformation,[],[f92]) ).
fof(f135,plain,
! [X0,X1] :
( X0 = X1
| ~ incident_c(sK12(X0,X1),X1)
| ~ incident_c(sK12(X0,X1),X0) ),
inference(cnf_transformation,[],[f92]) ).
fof(f136,plain,
part_of(sK13,sK14),
inference(cnf_transformation,[],[f94]) ).
fof(f137,plain,
part_of(sK14,sK13),
inference(cnf_transformation,[],[f94]) ).
fof(f138,plain,
sK13 != sK14,
inference(cnf_transformation,[],[f94]) ).
cnf(c_51,plain,
( ~ part_of(X0,X1)
| ~ incident_c(X2,X0)
| incident_c(X2,X1) ),
inference(cnf_transformation,[],[f95]) ).
cnf(c_88,plain,
( ~ incident_c(sK12(X0,X1),X0)
| ~ incident_c(sK12(X0,X1),X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f135]) ).
cnf(c_89,plain,
( X0 = X1
| incident_c(sK12(X0,X1),X0)
| incident_c(sK12(X0,X1),X1) ),
inference(cnf_transformation,[],[f134]) ).
cnf(c_90,negated_conjecture,
sK13 != sK14,
inference(cnf_transformation,[],[f138]) ).
cnf(c_91,negated_conjecture,
part_of(sK14,sK13),
inference(cnf_transformation,[],[f137]) ).
cnf(c_92,negated_conjecture,
part_of(sK13,sK14),
inference(cnf_transformation,[],[f136]) ).
cnf(c_2052,plain,
( ~ incident_c(sK12(sK13,sK14),sK13)
| ~ incident_c(sK12(sK13,sK14),sK14)
| sK13 = sK14 ),
inference(instantiation,[status(thm)],[c_88]) ).
cnf(c_2053,plain,
( sK13 = sK14
| incident_c(sK12(sK13,sK14),sK13)
| incident_c(sK12(sK13,sK14),sK14) ),
inference(instantiation,[status(thm)],[c_89]) ).
cnf(c_2389,plain,
( ~ incident_c(sK12(sK13,sK14),sK13)
| ~ part_of(sK13,X0)
| incident_c(sK12(sK13,sK14),X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_3450,plain,
( ~ incident_c(sK12(sK13,sK14),sK14)
| ~ part_of(sK14,X0)
| incident_c(sK12(sK13,sK14),X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_3451,plain,
( ~ incident_c(sK12(sK13,sK14),sK14)
| ~ part_of(sK14,sK13)
| incident_c(sK12(sK13,sK14),sK13) ),
inference(instantiation,[status(thm)],[c_3450]) ).
cnf(c_9002,plain,
( ~ incident_c(sK12(sK13,sK14),sK13)
| ~ part_of(sK13,sK14)
| incident_c(sK12(sK13,sK14),sK14) ),
inference(instantiation,[status(thm)],[c_2389]) ).
cnf(c_10909,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_9002,c_3451,c_2053,c_2052,c_90,c_91,c_92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO082+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n009.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 : Tue Aug 29 20:02:20 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.62/1.16 % SZS status Started for theBenchmark.p
% 3.62/1.16 % SZS status Theorem for theBenchmark.p
% 3.62/1.16
% 3.62/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.62/1.16
% 3.62/1.16 ------ iProver source info
% 3.62/1.16
% 3.62/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.62/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.62/1.16 git: non_committed_changes: false
% 3.62/1.16 git: last_make_outside_of_git: false
% 3.62/1.16
% 3.62/1.16 ------ Parsing...
% 3.62/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.62/1.16
% 3.62/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.62/1.16
% 3.62/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.62/1.16
% 3.62/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.62/1.16 ------ Proving...
% 3.62/1.16 ------ Problem Properties
% 3.62/1.16
% 3.62/1.16
% 3.62/1.16 clauses 44
% 3.62/1.16 conjectures 3
% 3.62/1.16 EPR 16
% 3.62/1.16 Horn 28
% 3.62/1.16 unary 4
% 3.62/1.16 binary 16
% 3.62/1.16 lits 132
% 3.62/1.16 lits eq 13
% 3.62/1.16 fd_pure 0
% 3.62/1.16 fd_pseudo 0
% 3.62/1.16 fd_cond 0
% 3.62/1.16 fd_pseudo_cond 7
% 3.62/1.16 AC symbols 0
% 3.62/1.16
% 3.62/1.16 ------ Schedule dynamic 5 is on
% 3.62/1.16
% 3.62/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.62/1.16
% 3.62/1.16
% 3.62/1.16 ------
% 3.62/1.16 Current options:
% 3.62/1.16 ------
% 3.62/1.16
% 3.62/1.16
% 3.62/1.16
% 3.62/1.16
% 3.62/1.16 ------ Proving...
% 3.62/1.16
% 3.62/1.16
% 3.62/1.16 % SZS status Theorem for theBenchmark.p
% 3.62/1.16
% 3.62/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.62/1.16
% 3.62/1.16
%------------------------------------------------------------------------------