TSTP Solution File: GEO147+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO147+1 : TPTP v8.1.2. Released v2.4.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 : Wed Aug 30 23:09:40 EDT 2023
% Result : Theorem 3.13s 1.14s
% Output : CNFRefutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 13 unt; 0 def)
% Number of atoms : 91 ( 9 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 81 ( 34 ~; 24 |; 11 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 73 ( 2 sgn; 49 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f28,axiom,
! [X11,X12,X2] :
( connect(X11,X12,X2)
<=> once(at_the_same_time(at(X11,X2),at(X12,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',connect_defn) ).
fof(f32,axiom,
! [X13,X14] :
( once(at_the_same_time(X13,X14))
=> ( once(X14)
& once(X13) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjunction_at_the_same_time) ).
fof(f33,axiom,
! [X11,X2] :
( once(at(X11,X2))
<=> incident_o(X2,trajectory_of(X11)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',at_on_trajectory) ).
fof(f34,axiom,
! [X11] :
? [X8] : trajectory_of(X11) = X8,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',trajectories_are_oriented_curves) ).
fof(f37,conjecture,
! [X2,X11,X12] :
( connect(X11,X12,X2)
=> ( incident_o(X2,trajectory_of(X12))
& incident_o(X2,trajectory_of(X11)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13) ).
fof(f38,negated_conjecture,
~ ! [X2,X11,X12] :
( connect(X11,X12,X2)
=> ( incident_o(X2,trajectory_of(X12))
& incident_o(X2,trajectory_of(X11)) ) ),
inference(negated_conjecture,[],[f37]) ).
fof(f63,plain,
! [X0,X1,X2] :
( connect(X0,X1,X2)
<=> once(at_the_same_time(at(X0,X2),at(X1,X2))) ),
inference(rectify,[],[f28]) ).
fof(f67,plain,
! [X0,X1] :
( once(at_the_same_time(X0,X1))
=> ( once(X1)
& once(X0) ) ),
inference(rectify,[],[f32]) ).
fof(f68,plain,
! [X0,X1] :
( once(at(X0,X1))
<=> incident_o(X1,trajectory_of(X0)) ),
inference(rectify,[],[f33]) ).
fof(f69,plain,
! [X0] :
? [X1] : trajectory_of(X0) = X1,
inference(rectify,[],[f34]) ).
fof(f72,plain,
~ ! [X0,X1,X2] :
( connect(X1,X2,X0)
=> ( incident_o(X0,trajectory_of(X2))
& incident_o(X0,trajectory_of(X1)) ) ),
inference(rectify,[],[f38]) ).
fof(f73,plain,
! [X0,X1,X2] :
( connect(X0,X1,X2)
=> once(at_the_same_time(at(X0,X2),at(X1,X2))) ),
inference(unused_predicate_definition_removal,[],[f63]) ).
fof(f100,plain,
! [X0,X1,X2] :
( once(at_the_same_time(at(X0,X2),at(X1,X2)))
| ~ connect(X0,X1,X2) ),
inference(ennf_transformation,[],[f73]) ).
fof(f102,plain,
! [X0,X1] :
( ( once(X1)
& once(X0) )
| ~ once(at_the_same_time(X0,X1)) ),
inference(ennf_transformation,[],[f67]) ).
fof(f106,plain,
? [X0,X1,X2] :
( ( ~ incident_o(X0,trajectory_of(X2))
| ~ incident_o(X0,trajectory_of(X1)) )
& connect(X1,X2,X0) ),
inference(ennf_transformation,[],[f72]) ).
fof(f175,plain,
! [X0,X1] :
( ( once(at(X0,X1))
| ~ incident_o(X1,trajectory_of(X0)) )
& ( incident_o(X1,trajectory_of(X0))
| ~ once(at(X0,X1)) ) ),
inference(nnf_transformation,[],[f68]) ).
fof(f176,plain,
! [X0] :
( ? [X1] : trajectory_of(X0) = X1
=> trajectory_of(X0) = sK22(X0) ),
introduced(choice_axiom,[]) ).
fof(f177,plain,
! [X0] : trajectory_of(X0) = sK22(X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK22])],[f69,f176]) ).
fof(f180,plain,
( ? [X0,X1,X2] :
( ( ~ incident_o(X0,trajectory_of(X2))
| ~ incident_o(X0,trajectory_of(X1)) )
& connect(X1,X2,X0) )
=> ( ( ~ incident_o(sK24,trajectory_of(sK26))
| ~ incident_o(sK24,trajectory_of(sK25)) )
& connect(sK25,sK26,sK24) ) ),
introduced(choice_axiom,[]) ).
fof(f181,plain,
( ( ~ incident_o(sK24,trajectory_of(sK26))
| ~ incident_o(sK24,trajectory_of(sK25)) )
& connect(sK25,sK26,sK24) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK24,sK25,sK26])],[f106,f180]) ).
fof(f258,plain,
! [X2,X0,X1] :
( once(at_the_same_time(at(X0,X2),at(X1,X2)))
| ~ connect(X0,X1,X2) ),
inference(cnf_transformation,[],[f100]) ).
fof(f264,plain,
! [X0,X1] :
( once(X0)
| ~ once(at_the_same_time(X0,X1)) ),
inference(cnf_transformation,[],[f102]) ).
fof(f265,plain,
! [X0,X1] :
( once(X1)
| ~ once(at_the_same_time(X0,X1)) ),
inference(cnf_transformation,[],[f102]) ).
fof(f266,plain,
! [X0,X1] :
( incident_o(X1,trajectory_of(X0))
| ~ once(at(X0,X1)) ),
inference(cnf_transformation,[],[f175]) ).
fof(f268,plain,
! [X0] : trajectory_of(X0) = sK22(X0),
inference(cnf_transformation,[],[f177]) ).
fof(f271,plain,
connect(sK25,sK26,sK24),
inference(cnf_transformation,[],[f181]) ).
fof(f272,plain,
( ~ incident_o(sK24,trajectory_of(sK26))
| ~ incident_o(sK24,trajectory_of(sK25)) ),
inference(cnf_transformation,[],[f181]) ).
fof(f274,plain,
! [X0,X1] :
( incident_o(X1,sK22(X0))
| ~ once(at(X0,X1)) ),
inference(definition_unfolding,[],[f266,f268]) ).
fof(f276,plain,
( ~ incident_o(sK24,sK22(sK26))
| ~ incident_o(sK24,sK22(sK25)) ),
inference(definition_unfolding,[],[f272,f268,f268]) ).
cnf(c_125,plain,
( ~ connect(X0,X1,X2)
| once(at_the_same_time(at(X0,X2),at(X1,X2))) ),
inference(cnf_transformation,[],[f258]) ).
cnf(c_131,plain,
( ~ once(at_the_same_time(X0,X1))
| once(X1) ),
inference(cnf_transformation,[],[f265]) ).
cnf(c_132,plain,
( ~ once(at_the_same_time(X0,X1))
| once(X0) ),
inference(cnf_transformation,[],[f264]) ).
cnf(c_134,plain,
( ~ once(at(X0,X1))
| incident_o(X1,sK22(X0)) ),
inference(cnf_transformation,[],[f274]) ).
cnf(c_137,negated_conjecture,
( ~ incident_o(sK24,sK22(sK26))
| ~ incident_o(sK24,sK22(sK25)) ),
inference(cnf_transformation,[],[f276]) ).
cnf(c_138,negated_conjecture,
connect(sK25,sK26,sK24),
inference(cnf_transformation,[],[f271]) ).
cnf(c_280,plain,
( ~ connect(X0,X1,X2)
| once(at_the_same_time(at(X0,X2),at(X1,X2))) ),
inference(prop_impl_just,[status(thm)],[c_125]) ).
cnf(c_1554,plain,
( X0 != sK25
| X1 != sK26
| X2 != sK24
| once(at_the_same_time(at(X0,X2),at(X1,X2))) ),
inference(resolution_lifted,[status(thm)],[c_280,c_138]) ).
cnf(c_1555,plain,
once(at_the_same_time(at(sK25,sK24),at(sK26,sK24))),
inference(unflattening,[status(thm)],[c_1554]) ).
cnf(c_7145,plain,
once(at(sK26,sK24)),
inference(superposition,[status(thm)],[c_1555,c_131]) ).
cnf(c_7151,plain,
once(at(sK25,sK24)),
inference(superposition,[status(thm)],[c_1555,c_132]) ).
cnf(c_7358,plain,
incident_o(sK24,sK22(sK26)),
inference(superposition,[status(thm)],[c_7145,c_134]) ).
cnf(c_7359,plain,
incident_o(sK24,sK22(sK25)),
inference(superposition,[status(thm)],[c_7151,c_134]) ).
cnf(c_7364,plain,
~ incident_o(sK24,sK22(sK25)),
inference(backward_subsumption_resolution,[status(thm)],[c_137,c_7358]) ).
cnf(c_7365,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7364,c_7359]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO147+1 : TPTP v8.1.2. Released v2.4.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 : Tue Aug 29 21:58:47 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.13/1.14 % SZS status Started for theBenchmark.p
% 3.13/1.14 % SZS status Theorem for theBenchmark.p
% 3.13/1.14
% 3.13/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.13/1.14
% 3.13/1.14 ------ iProver source info
% 3.13/1.14
% 3.13/1.14 git: date: 2023-05-31 18:12:56 +0000
% 3.13/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.13/1.14 git: non_committed_changes: false
% 3.13/1.14 git: last_make_outside_of_git: false
% 3.13/1.14
% 3.13/1.14 ------ Parsing...
% 3.13/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.13/1.14
% 3.13/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 3.13/1.14
% 3.13/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.13/1.14
% 3.13/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.13/1.14 ------ Proving...
% 3.13/1.14 ------ Problem Properties
% 3.13/1.14
% 3.13/1.14
% 3.13/1.14 clauses 87
% 3.13/1.14 conjectures 1
% 3.13/1.14 EPR 24
% 3.13/1.14 Horn 59
% 3.13/1.14 unary 5
% 3.13/1.14 binary 38
% 3.13/1.14 lits 251
% 3.13/1.14 lits eq 21
% 3.13/1.14 fd_pure 0
% 3.13/1.14 fd_pseudo 0
% 3.13/1.14 fd_cond 0
% 3.13/1.14 fd_pseudo_cond 16
% 3.13/1.14 AC symbols 0
% 3.13/1.14
% 3.13/1.14 ------ Schedule dynamic 5 is on
% 3.13/1.14
% 3.13/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.13/1.14
% 3.13/1.14
% 3.13/1.14 ------
% 3.13/1.14 Current options:
% 3.13/1.14 ------
% 3.13/1.14
% 3.13/1.14
% 3.13/1.14
% 3.13/1.14
% 3.13/1.14 ------ Proving...
% 3.13/1.14
% 3.13/1.14
% 3.13/1.14 % SZS status Theorem for theBenchmark.p
% 3.13/1.14
% 3.13/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.13/1.14
% 3.13/1.14
%------------------------------------------------------------------------------