TSTP Solution File: GRA010+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRA010+2 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:19:24 EDT 2024
% Result : Theorem 0.65s 1.11s
% Output : CNFRefutation 0.65s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X3,X1,X2] :
( ( ! [X6,X7] :
( ( sequential(X6,X7)
& on_path(X7,X3)
& on_path(X6,X3) )
=> ? [X8] : triangle(X6,X7,X8) )
& path(X1,X2,X3) )
=> number_of_in(sequential_pairs,X3) = number_of_in(triangles,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
fof(f19,conjecture,
( complete
=> ! [X3,X1,X2] :
( ( ! [X6,X7] :
( ( sequential(X6,X7)
& on_path(X7,X3)
& on_path(X6,X3) )
=> ? [X8] : triangle(X6,X7,X8) )
& path(X1,X2,X3) )
=> number_of_in(sequential_pairs,X3) = number_of_in(triangles,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles) ).
fof(f20,negated_conjecture,
~ ( complete
=> ! [X3,X1,X2] :
( ( ! [X6,X7] :
( ( sequential(X6,X7)
& on_path(X7,X3)
& on_path(X6,X3) )
=> ? [X8] : triangle(X6,X7,X8) )
& path(X1,X2,X3) )
=> number_of_in(sequential_pairs,X3) = number_of_in(triangles,X3) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( ! [X3,X4] :
( ( sequential(X3,X4)
& on_path(X4,X0)
& on_path(X3,X0) )
=> ? [X5] : triangle(X3,X4,X5) )
& path(X1,X2,X0) )
=> number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
inference(rectify,[],[f16]) ).
fof(f37,plain,
~ ( complete
=> ! [X0,X1,X2] :
( ( ! [X3,X4] :
( ( sequential(X3,X4)
& on_path(X4,X0)
& on_path(X3,X0) )
=> ? [X5] : triangle(X3,X4,X5) )
& path(X1,X2,X0) )
=> number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ) ),
inference(rectify,[],[f20]) ).
fof(f59,plain,
! [X0,X1,X2] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ? [X3,X4] :
( ! [X5] : ~ triangle(X3,X4,X5)
& sequential(X3,X4)
& on_path(X4,X0)
& on_path(X3,X0) )
| ~ path(X1,X2,X0) ),
inference(ennf_transformation,[],[f34]) ).
fof(f60,plain,
! [X0,X1,X2] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ? [X3,X4] :
( ! [X5] : ~ triangle(X3,X4,X5)
& sequential(X3,X4)
& on_path(X4,X0)
& on_path(X3,X0) )
| ~ path(X1,X2,X0) ),
inference(flattening,[],[f59]) ).
fof(f63,plain,
( ? [X0,X1,X2] :
( number_of_in(sequential_pairs,X0) != number_of_in(triangles,X0)
& ! [X3,X4] :
( ? [X5] : triangle(X3,X4,X5)
| ~ sequential(X3,X4)
| ~ on_path(X4,X0)
| ~ on_path(X3,X0) )
& path(X1,X2,X0) )
& complete ),
inference(ennf_transformation,[],[f37]) ).
fof(f64,plain,
( ? [X0,X1,X2] :
( number_of_in(sequential_pairs,X0) != number_of_in(triangles,X0)
& ! [X3,X4] :
( ? [X5] : triangle(X3,X4,X5)
| ~ sequential(X3,X4)
| ~ on_path(X4,X0)
| ~ on_path(X3,X0) )
& path(X1,X2,X0) )
& complete ),
inference(flattening,[],[f63]) ).
fof(f88,plain,
! [X0] :
( ? [X3,X4] :
( ! [X5] : ~ triangle(X3,X4,X5)
& sequential(X3,X4)
& on_path(X4,X0)
& on_path(X3,X0) )
=> ( ! [X5] : ~ triangle(sK6(X0),sK7(X0),X5)
& sequential(sK6(X0),sK7(X0))
& on_path(sK7(X0),X0)
& on_path(sK6(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f89,plain,
! [X0,X1,X2] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ( ! [X5] : ~ triangle(sK6(X0),sK7(X0),X5)
& sequential(sK6(X0),sK7(X0))
& on_path(sK7(X0),X0)
& on_path(sK6(X0),X0) )
| ~ path(X1,X2,X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f60,f88]) ).
fof(f92,plain,
( ? [X0,X1,X2] :
( number_of_in(sequential_pairs,X0) != number_of_in(triangles,X0)
& ! [X3,X4] :
( ? [X5] : triangle(X3,X4,X5)
| ~ sequential(X3,X4)
| ~ on_path(X4,X0)
| ~ on_path(X3,X0) )
& path(X1,X2,X0) )
=> ( number_of_in(sequential_pairs,sK9) != number_of_in(triangles,sK9)
& ! [X4,X3] :
( ? [X5] : triangle(X3,X4,X5)
| ~ sequential(X3,X4)
| ~ on_path(X4,sK9)
| ~ on_path(X3,sK9) )
& path(sK10,sK11,sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
! [X3,X4] :
( ? [X5] : triangle(X3,X4,X5)
=> triangle(X3,X4,sK12(X3,X4)) ),
introduced(choice_axiom,[]) ).
fof(f94,plain,
( number_of_in(sequential_pairs,sK9) != number_of_in(triangles,sK9)
& ! [X3,X4] :
( triangle(X3,X4,sK12(X3,X4))
| ~ sequential(X3,X4)
| ~ on_path(X4,sK9)
| ~ on_path(X3,sK9) )
& path(sK10,sK11,sK9)
& complete ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12])],[f64,f93,f92]) ).
fof(f146,plain,
! [X2,X0,X1] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| on_path(sK6(X0),X0)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f89]) ).
fof(f147,plain,
! [X2,X0,X1] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| on_path(sK7(X0),X0)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f89]) ).
fof(f148,plain,
! [X2,X0,X1] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| sequential(sK6(X0),sK7(X0))
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f89]) ).
fof(f149,plain,
! [X2,X0,X1,X5] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ~ triangle(sK6(X0),sK7(X0),X5)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f89]) ).
fof(f153,plain,
path(sK10,sK11,sK9),
inference(cnf_transformation,[],[f94]) ).
fof(f154,plain,
! [X3,X4] :
( triangle(X3,X4,sK12(X3,X4))
| ~ sequential(X3,X4)
| ~ on_path(X4,sK9)
| ~ on_path(X3,sK9) ),
inference(cnf_transformation,[],[f94]) ).
fof(f155,plain,
number_of_in(sequential_pairs,sK9) != number_of_in(triangles,sK9),
inference(cnf_transformation,[],[f94]) ).
cnf(c_100,plain,
( ~ triangle(sK6(X0),sK7(X0),X1)
| ~ path(X2,X3,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
inference(cnf_transformation,[],[f149]) ).
cnf(c_101,plain,
( ~ path(X0,X1,X2)
| number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
| sequential(sK6(X2),sK7(X2)) ),
inference(cnf_transformation,[],[f148]) ).
cnf(c_102,plain,
( ~ path(X0,X1,X2)
| number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
| on_path(sK7(X2),X2) ),
inference(cnf_transformation,[],[f147]) ).
cnf(c_103,plain,
( ~ path(X0,X1,X2)
| number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
| on_path(sK6(X2),X2) ),
inference(cnf_transformation,[],[f146]) ).
cnf(c_106,negated_conjecture,
number_of_in(sequential_pairs,sK9) != number_of_in(triangles,sK9),
inference(cnf_transformation,[],[f155]) ).
cnf(c_107,negated_conjecture,
( ~ sequential(X0,X1)
| ~ on_path(X0,sK9)
| ~ on_path(X1,sK9)
| triangle(X0,X1,sK12(X0,X1)) ),
inference(cnf_transformation,[],[f154]) ).
cnf(c_108,negated_conjecture,
path(sK10,sK11,sK9),
inference(cnf_transformation,[],[f153]) ).
cnf(c_2667,plain,
number_of_in(sequential_pairs,sK9) = sP0_iProver_def,
definition ).
cnf(c_2668,plain,
number_of_in(triangles,sK9) = sP1_iProver_def,
definition ).
cnf(c_2669,negated_conjecture,
path(sK10,sK11,sK9),
inference(demodulation,[status(thm)],[c_108]) ).
cnf(c_2670,negated_conjecture,
( ~ sequential(X0,X1)
| ~ on_path(X0,sK9)
| ~ on_path(X1,sK9)
| triangle(X0,X1,sK12(X0,X1)) ),
inference(demodulation,[status(thm)],[c_107]) ).
cnf(c_2671,negated_conjecture,
sP0_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_106,c_2668,c_2667]) ).
cnf(c_4361,plain,
( number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9)
| on_path(sK7(sK9),sK9) ),
inference(superposition,[status(thm)],[c_2669,c_102]) ).
cnf(c_4363,plain,
( sP0_iProver_def = sP1_iProver_def
| on_path(sK7(sK9),sK9) ),
inference(light_normalisation,[status(thm)],[c_4361,c_2667,c_2668]) ).
cnf(c_4364,plain,
on_path(sK7(sK9),sK9),
inference(forward_subsumption_resolution,[status(thm)],[c_4363,c_2671]) ).
cnf(c_4680,plain,
( number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9)
| on_path(sK6(sK9),sK9) ),
inference(superposition,[status(thm)],[c_2669,c_103]) ).
cnf(c_4685,plain,
( sP0_iProver_def = sP1_iProver_def
| on_path(sK6(sK9),sK9) ),
inference(light_normalisation,[status(thm)],[c_4680,c_2667,c_2668]) ).
cnf(c_4686,plain,
on_path(sK6(sK9),sK9),
inference(forward_subsumption_resolution,[status(thm)],[c_4685,c_2671]) ).
cnf(c_5253,plain,
( ~ sequential(sK6(X0),sK7(X0))
| ~ path(X1,X2,X0)
| ~ on_path(sK6(X0),sK9)
| ~ on_path(sK7(X0),sK9)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
inference(superposition,[status(thm)],[c_2670,c_100]) ).
cnf(c_5389,plain,
( ~ path(X0,X1,X2)
| ~ on_path(sK6(X2),sK9)
| ~ on_path(sK7(X2),sK9)
| number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5253,c_101]) ).
cnf(c_5397,plain,
( ~ on_path(sK6(sK9),sK9)
| ~ on_path(sK7(sK9),sK9)
| number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9) ),
inference(superposition,[status(thm)],[c_2669,c_5389]) ).
cnf(c_5402,plain,
( ~ on_path(sK6(sK9),sK9)
| ~ on_path(sK7(sK9),sK9)
| sP0_iProver_def = sP1_iProver_def ),
inference(light_normalisation,[status(thm)],[c_5397,c_2667,c_2668]) ).
cnf(c_5403,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5402,c_2671,c_4364,c_4686]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRA010+2 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.11/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n027.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 21:51:05 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.65/1.11 % SZS status Started for theBenchmark.p
% 0.65/1.11 % SZS status Theorem for theBenchmark.p
% 0.65/1.11
% 0.65/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.65/1.11
% 0.65/1.11 ------ iProver source info
% 0.65/1.11
% 0.65/1.11 git: date: 2024-05-02 19:28:25 +0000
% 0.65/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.65/1.11 git: non_committed_changes: false
% 0.65/1.11
% 0.65/1.11 ------ Parsing...
% 0.65/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.65/1.11
% 0.65/1.11 ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.65/1.11
% 0.65/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.65/1.11
% 0.65/1.11 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.65/1.11 ------ Proving...
% 0.65/1.11 ------ Problem Properties
% 0.65/1.11
% 0.65/1.11
% 0.65/1.11 clauses 62
% 0.65/1.11 conjectures 3
% 0.65/1.11 EPR 22
% 0.65/1.11 Horn 44
% 0.65/1.11 unary 6
% 0.65/1.11 binary 19
% 0.65/1.11 lits 187
% 0.65/1.11 lits eq 47
% 0.65/1.11 fd_pure 0
% 0.65/1.11 fd_pseudo 0
% 0.65/1.11 fd_cond 0
% 0.65/1.11 fd_pseudo_cond 5
% 0.65/1.11 AC symbols 0
% 0.65/1.11
% 0.65/1.11 ------ Schedule dynamic 5 is on
% 0.65/1.11
% 0.65/1.11 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.65/1.11
% 0.65/1.11
% 0.65/1.11 ------
% 0.65/1.11 Current options:
% 0.65/1.11 ------
% 0.65/1.11
% 0.65/1.11
% 0.65/1.11
% 0.65/1.11
% 0.65/1.11 ------ Proving...
% 0.65/1.11
% 0.65/1.11
% 0.65/1.11 % SZS status Theorem for theBenchmark.p
% 0.65/1.11
% 0.65/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.65/1.11
% 0.65/1.11
%------------------------------------------------------------------------------