TSTP Solution File: GEO206+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO206+3 : TPTP v8.1.2. Bugfixed v4.0.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:10:16 EDT 2023
% Result : Theorem 1.77s 1.22s
% Output : CNFRefutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 11 unt; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 77 ( 33 ~; 23 |; 12 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 1 sgn; 44 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( convergent_lines(X1,X2)
| convergent_lines(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).
fof(f15,axiom,
! [X0,X1] :
( distinct_lines(X0,X1)
=> convergent_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p1) ).
fof(f16,axiom,
! [X0,X1] : ~ convergent_lines(parallel_through_point(X1,X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cp1) ).
fof(f32,axiom,
! [X0,X1] :
( equal_lines(X0,X1)
<=> ~ distinct_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
fof(f33,axiom,
! [X0,X1] :
( parallel_lines(X0,X1)
<=> ~ convergent_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3) ).
fof(f36,conjecture,
! [X0,X1,X2] :
( ( parallel_lines(X1,X2)
& incident_point_and_line(X0,X1) )
=> equal_lines(X1,parallel_through_point(X2,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f37,negated_conjecture,
~ ! [X0,X1,X2] :
( ( parallel_lines(X1,X2)
& incident_point_and_line(X0,X1) )
=> equal_lines(X1,parallel_through_point(X2,X0)) ),
inference(negated_conjecture,[],[f36]) ).
fof(f52,plain,
! [X0,X1] :
( parallel_lines(X0,X1)
=> ~ convergent_lines(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f33]) ).
fof(f53,plain,
! [X0,X1] :
( ~ distinct_lines(X0,X1)
=> equal_lines(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f32]) ).
fof(f58,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f59,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f58]) ).
fof(f72,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
| ~ distinct_lines(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f92,plain,
! [X0,X1] :
( equal_lines(X0,X1)
| distinct_lines(X0,X1) ),
inference(ennf_transformation,[],[f53]) ).
fof(f93,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ parallel_lines(X0,X1) ),
inference(ennf_transformation,[],[f52]) ).
fof(f95,plain,
? [X0,X1,X2] :
( ~ equal_lines(X1,parallel_through_point(X2,X0))
& parallel_lines(X1,X2)
& incident_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f96,plain,
? [X0,X1,X2] :
( ~ equal_lines(X1,parallel_through_point(X2,X0))
& parallel_lines(X1,X2)
& incident_point_and_line(X0,X1) ),
inference(flattening,[],[f95]) ).
fof(f97,plain,
( ? [X0,X1,X2] :
( ~ equal_lines(X1,parallel_through_point(X2,X0))
& parallel_lines(X1,X2)
& incident_point_and_line(X0,X1) )
=> ( ~ equal_lines(sK1,parallel_through_point(sK2,sK0))
& parallel_lines(sK1,sK2)
& incident_point_and_line(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
( ~ equal_lines(sK1,parallel_through_point(sK2,sK0))
& parallel_lines(sK1,sK2)
& incident_point_and_line(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f96,f97]) ).
fof(f104,plain,
! [X2,X0,X1] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f113,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
| ~ distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f72]) ).
fof(f114,plain,
! [X0,X1] : ~ convergent_lines(parallel_through_point(X1,X0),X1),
inference(cnf_transformation,[],[f16]) ).
fof(f135,plain,
! [X0,X1] :
( equal_lines(X0,X1)
| distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f92]) ).
fof(f136,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ parallel_lines(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
fof(f139,plain,
parallel_lines(sK1,sK2),
inference(cnf_transformation,[],[f98]) ).
fof(f140,plain,
~ equal_lines(sK1,parallel_through_point(sK2,sK0)),
inference(cnf_transformation,[],[f98]) ).
cnf(c_54,plain,
( ~ convergent_lines(X0,X1)
| convergent_lines(X0,X2)
| convergent_lines(X1,X2) ),
inference(cnf_transformation,[],[f104]) ).
cnf(c_63,plain,
( ~ distinct_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f113]) ).
cnf(c_64,plain,
~ convergent_lines(parallel_through_point(X0,X1),X0),
inference(cnf_transformation,[],[f114]) ).
cnf(c_85,plain,
( distinct_lines(X0,X1)
| equal_lines(X0,X1) ),
inference(cnf_transformation,[],[f135]) ).
cnf(c_86,plain,
( ~ convergent_lines(X0,X1)
| ~ parallel_lines(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
cnf(c_88,negated_conjecture,
~ equal_lines(sK1,parallel_through_point(sK2,sK0)),
inference(cnf_transformation,[],[f140]) ).
cnf(c_89,negated_conjecture,
parallel_lines(sK1,sK2),
inference(cnf_transformation,[],[f139]) ).
cnf(c_305,plain,
distinct_lines(sK1,parallel_through_point(sK2,sK0)),
inference(resolution,[status(thm)],[c_85,c_88]) ).
cnf(c_310,plain,
~ convergent_lines(sK1,sK2),
inference(resolution,[status(thm)],[c_86,c_89]) ).
cnf(c_476,plain,
( ~ distinct_lines(sK1,parallel_through_point(sK2,sK0))
| convergent_lines(sK1,parallel_through_point(sK2,sK0)) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_492,plain,
( ~ convergent_lines(sK1,parallel_through_point(sK2,sK0))
| convergent_lines(parallel_through_point(sK2,sK0),X0)
| convergent_lines(sK1,X0) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_575,plain,
( ~ convergent_lines(sK1,parallel_through_point(sK2,sK0))
| convergent_lines(parallel_through_point(sK2,sK0),sK2)
| convergent_lines(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_492]) ).
cnf(c_576,plain,
~ convergent_lines(parallel_through_point(sK2,sK0),sK2),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_577,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_576,c_575,c_476,c_310,c_305]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : GEO206+3 : TPTP v8.1.2. Bugfixed v4.0.1.
% 0.08/0.15 % Command : run_iprover %s %d THM
% 0.15/0.37 % Computer : n029.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Aug 29 23:48:12 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.77/1.22 % SZS status Started for theBenchmark.p
% 1.77/1.22 % SZS status Theorem for theBenchmark.p
% 1.77/1.22
% 1.77/1.22 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.77/1.22
% 1.77/1.22 ------ iProver source info
% 1.77/1.22
% 1.77/1.22 git: date: 2023-05-31 18:12:56 +0000
% 1.77/1.22 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.77/1.22 git: non_committed_changes: false
% 1.77/1.22 git: last_make_outside_of_git: false
% 1.77/1.22
% 1.77/1.22 ------ Parsing...
% 1.77/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.77/1.22
% 1.77/1.22 ------ Preprocessing... sf_s rm: 4 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.77/1.22
% 1.77/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.77/1.22 ------ Proving...
% 1.77/1.22 ------ Problem Properties
% 1.77/1.22
% 1.77/1.22
% 1.77/1.22 clauses 31
% 1.77/1.22 conjectures 0
% 1.77/1.22 EPR 22
% 1.77/1.22 Horn 15
% 1.77/1.22 unary 10
% 1.77/1.22 binary 6
% 1.77/1.22 lits 78
% 1.77/1.22 lits eq 0
% 1.77/1.22 fd_pure 0
% 1.77/1.22 fd_pseudo 0
% 1.77/1.22 fd_cond 0
% 1.77/1.22 fd_pseudo_cond 0
% 1.77/1.22 AC symbols 0
% 1.77/1.22
% 1.77/1.22 ------ Schedule dynamic 5 is on
% 1.77/1.22
% 1.77/1.22 ------ no conjectures: strip conj schedule
% 1.77/1.22
% 1.77/1.22 ------ no equalities: superposition off
% 1.77/1.22
% 1.77/1.22 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.77/1.22
% 1.77/1.22
% 1.77/1.22 ------
% 1.77/1.22 Current options:
% 1.77/1.22 ------
% 1.77/1.22
% 1.77/1.22
% 1.77/1.22
% 1.77/1.22
% 1.77/1.22 ------ Proving...
% 1.77/1.22
% 1.77/1.22
% 1.77/1.22 % SZS status Theorem for theBenchmark.p
% 1.77/1.22
% 1.77/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.77/1.22
% 1.77/1.22
%------------------------------------------------------------------------------