TSTP Solution File: GEO146+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO146+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:16:33 EDT 2024
% Result : Theorem 4.25s 1.20s
% Output : CNFRefutation 4.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 3 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 65 ( 26 ~; 24 |; 6 &)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 32 !; 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/sandbox2/benchmark/theBenchmark.p',connect_defn) ).
fof(f29,axiom,
! [X13,X14] :
( once(at_the_same_time(X13,X14))
<=> once(at_the_same_time(X14,X13)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_at_the_same_time) ).
fof(f37,conjecture,
! [X11,X12,X2] :
( connect(X11,X12,X2)
<=> connect(X12,X11,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12) ).
fof(f38,negated_conjecture,
~ ! [X11,X12,X2] :
( connect(X11,X12,X2)
<=> connect(X12,X11,X2) ),
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(f64,plain,
! [X0,X1] :
( once(at_the_same_time(X0,X1))
<=> once(at_the_same_time(X1,X0)) ),
inference(rectify,[],[f29]) ).
fof(f72,plain,
~ ! [X0,X1,X2] :
( connect(X0,X1,X2)
<=> connect(X1,X0,X2) ),
inference(rectify,[],[f38]) ).
fof(f104,plain,
? [X0,X1,X2] :
( connect(X0,X1,X2)
<~> connect(X1,X0,X2) ),
inference(ennf_transformation,[],[f72]) ).
fof(f171,plain,
! [X0,X1,X2] :
( ( connect(X0,X1,X2)
| ~ once(at_the_same_time(at(X0,X2),at(X1,X2))) )
& ( once(at_the_same_time(at(X0,X2),at(X1,X2)))
| ~ connect(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f63]) ).
fof(f172,plain,
! [X0,X1] :
( ( once(at_the_same_time(X0,X1))
| ~ once(at_the_same_time(X1,X0)) )
& ( once(at_the_same_time(X1,X0))
| ~ once(at_the_same_time(X0,X1)) ) ),
inference(nnf_transformation,[],[f64]) ).
fof(f179,plain,
? [X0,X1,X2] :
( ( ~ connect(X1,X0,X2)
| ~ connect(X0,X1,X2) )
& ( connect(X1,X0,X2)
| connect(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f104]) ).
fof(f180,plain,
( ? [X0,X1,X2] :
( ( ~ connect(X1,X0,X2)
| ~ connect(X0,X1,X2) )
& ( connect(X1,X0,X2)
| connect(X0,X1,X2) ) )
=> ( ( ~ connect(sK25,sK24,sK26)
| ~ connect(sK24,sK25,sK26) )
& ( connect(sK25,sK24,sK26)
| connect(sK24,sK25,sK26) ) ) ),
introduced(choice_axiom,[]) ).
fof(f181,plain,
( ( ~ connect(sK25,sK24,sK26)
| ~ connect(sK24,sK25,sK26) )
& ( connect(sK25,sK24,sK26)
| connect(sK24,sK25,sK26) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK24,sK25,sK26])],[f179,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,[],[f171]) ).
fof(f259,plain,
! [X2,X0,X1] :
( connect(X0,X1,X2)
| ~ once(at_the_same_time(at(X0,X2),at(X1,X2))) ),
inference(cnf_transformation,[],[f171]) ).
fof(f260,plain,
! [X0,X1] :
( once(at_the_same_time(X1,X0))
| ~ once(at_the_same_time(X0,X1)) ),
inference(cnf_transformation,[],[f172]) ).
fof(f272,plain,
( connect(sK25,sK24,sK26)
| connect(sK24,sK25,sK26) ),
inference(cnf_transformation,[],[f181]) ).
fof(f273,plain,
( ~ connect(sK25,sK24,sK26)
| ~ connect(sK24,sK25,sK26) ),
inference(cnf_transformation,[],[f181]) ).
cnf(c_125,plain,
( ~ once(at_the_same_time(at(X0,X1),at(X2,X1)))
| connect(X0,X2,X1) ),
inference(cnf_transformation,[],[f259]) ).
cnf(c_126,plain,
( ~ connect(X0,X1,X2)
| once(at_the_same_time(at(X0,X2),at(X1,X2))) ),
inference(cnf_transformation,[],[f258]) ).
cnf(c_128,plain,
( ~ once(at_the_same_time(X0,X1))
| once(at_the_same_time(X1,X0)) ),
inference(cnf_transformation,[],[f260]) ).
cnf(c_138,negated_conjecture,
( ~ connect(sK25,sK24,sK26)
| ~ connect(sK24,sK25,sK26) ),
inference(cnf_transformation,[],[f273]) ).
cnf(c_139,negated_conjecture,
( connect(sK25,sK24,sK26)
| connect(sK24,sK25,sK26) ),
inference(cnf_transformation,[],[f272]) ).
cnf(c_10124,plain,
( ~ connect(X0,X1,X2)
| once(at_the_same_time(at(X1,X2),at(X0,X2))) ),
inference(superposition,[status(thm)],[c_126,c_128]) ).
cnf(c_10250,plain,
( ~ connect(X0,X1,X2)
| connect(X1,X0,X2) ),
inference(superposition,[status(thm)],[c_10124,c_125]) ).
cnf(c_10471,plain,
connect(sK24,sK25,sK26),
inference(backward_subsumption_resolution,[status(thm)],[c_139,c_10250]) ).
cnf(c_11073,plain,
connect(sK25,sK24,sK26),
inference(superposition,[status(thm)],[c_10471,c_10250]) ).
cnf(c_11076,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11073,c_10471,c_138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO146+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 01:18:26 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 4.25/1.20 % SZS status Started for theBenchmark.p
% 4.25/1.20 % SZS status Theorem for theBenchmark.p
% 4.25/1.20
% 4.25/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.25/1.20
% 4.25/1.20 ------ iProver source info
% 4.25/1.20
% 4.25/1.20 git: date: 2024-05-02 19:28:25 +0000
% 4.25/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.25/1.20 git: non_committed_changes: false
% 4.25/1.20
% 4.25/1.20 ------ Parsing...
% 4.25/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.25/1.20
% 4.25/1.20 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 4.25/1.20
% 4.25/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.25/1.20
% 4.25/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.25/1.20 ------ Proving...
% 4.25/1.20 ------ Problem Properties
% 4.25/1.20
% 4.25/1.20
% 4.25/1.20 clauses 89
% 4.25/1.20 conjectures 2
% 4.25/1.20 EPR 26
% 4.25/1.20 Horn 60
% 4.25/1.20 unary 4
% 4.25/1.20 binary 41
% 4.25/1.20 lits 256
% 4.25/1.20 lits eq 21
% 4.25/1.20 fd_pure 0
% 4.25/1.20 fd_pseudo 0
% 4.25/1.20 fd_cond 0
% 4.25/1.20 fd_pseudo_cond 16
% 4.25/1.20 AC symbols 0
% 4.25/1.20
% 4.25/1.20 ------ Input Options Time Limit: Unbounded
% 4.25/1.20
% 4.25/1.20
% 4.25/1.20 ------
% 4.25/1.20 Current options:
% 4.25/1.20 ------
% 4.25/1.20
% 4.25/1.20
% 4.25/1.20
% 4.25/1.20
% 4.25/1.20 ------ Proving...
% 4.25/1.20
% 4.25/1.20
% 4.25/1.20 ------ Proving...
% 4.25/1.20
% 4.25/1.20
% 4.25/1.20 ------ Proving...
% 4.25/1.20
% 4.25/1.20
% 4.25/1.20 % SZS status Theorem for theBenchmark.p
% 4.25/1.20
% 4.25/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.25/1.21
% 4.25/1.21
%------------------------------------------------------------------------------