TSTP Solution File: GEO342+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO342+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:11:04 EDT 2023
% Result : Theorem 9.93s 2.15s
% Output : CNFRefutation 9.93s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f854)
% Comments :
%------------------------------------------------------------------------------
fof(f463,plain,
( ? [X0] :
( rpoint(X0)
& vd1399 = X0 )
=> ( rpoint(sK1)
& vd1399 = sK1 ) ),
introduced(choice_axiom,[]) ).
fof(f464,plain,
( ? [X1] :
( rpoint(X1)
& vd1400 = X1 )
=> ( rpoint(sK2)
& vd1400 = sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f465,plain,
( ? [X2] :
( rpoint(X2)
& vd1401 = X2 )
=> ( rpoint(sK3)
& vd1401 = sK3 ) ),
introduced(choice_axiom,[]) ).
fof(f484,plain,
! [X0,X1] :
( ? [X2] :
( rline(X2)
& ron(X0,X2)
& ron(X1,X2) )
=> ( rline(sK8(X0,X1))
& ron(X0,sK8(X0,X1))
& ron(X1,sK8(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
cnf(c_49,negated_conjecture,
( ~ ron(sK3,X0)
| ~ ron(sK1,X0)
| ~ rline(X0) ),
inference(cnf_transformation,[],[f854]) ).
cnf(c_108,plain,
( ~ rpoint(X0)
| ~ rpoint(X1)
| X0 = X1
| ron(X0,sK8(X0,X1)) ),
inference(cnf_transformation,[],[f1045]) ).
cnf(c_26087,plain,
( ~ ron(sK1,sK8(sK3,X0))
| ~ rline(sK8(sK3,X0))
| ~ rpoint(X0)
| ~ rpoint(sK3)
| X0 = sK3 ),
inference(superposition,[status(thm)],[c_108,c_49]) ).
fof(f9,axiom,
( ? [X3] :
( rpoint(X3)
& vd1399 = X3 )
& ? [X2] :
( rpoint(X2)
& vd1400 = X2 )
& ? [X1] :
( rpoint(X1)
& vd1401 = X1 )
& vd1399 != vd1400
& vd1399 != vd1401
& vd1401 != vd1400
& rline(vd1407)
& ron(vd1399,vd1406)
& ron(vd1400,vd1406)
& vd1406 = vd1407 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))') ).
fof(f602,plain,
vd1400 = sK2,
inference(cnf_transformation,[],[f466]) ).
fof(f36,axiom,
! [X122,X123] :
( ( ? [X125] :
( rpoint(X125)
& X122 = X125 )
& ? [X124] :
( rpoint(X124)
& X123 = X124 )
& X122 != X123 )
=> ? [X126] :
( rline(X126)
& ron(X122,X126)
& ron(X123,X126) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))') ).
fof(f1045,plain,
! [X3,X4] :
( ron(X3,sK8(X3,X4))
| ~ rpoint(X3)
| ~ rpoint(X4)
| X3 = X4 ),
inference(equality_resolution,[],[f1044]) ).
fof(f126,plain,
( ? [X0] :
( rpoint(X0)
& vd1399 = X0 )
& ? [X1] :
( rpoint(X1)
& vd1400 = X1 )
& ? [X2] :
( rpoint(X2)
& vd1401 = X2 )
& vd1399 != vd1400
& vd1399 != vd1401
& vd1401 != vd1400
& rline(vd1407)
& ron(vd1399,vd1406)
& ron(vd1400,vd1406)
& vd1406 = vd1407 ),
inference(rectify,[],[f9]) ).
fof(f153,plain,
! [X0,X1] :
( ( ? [X2] :
( rpoint(X2)
& X0 = X2 )
& ? [X3] :
( rpoint(X3)
& X1 = X3 )
& X0 != X1 )
=> ? [X4] :
( rline(X4)
& ron(X0,X4)
& ron(X1,X4) ) ),
inference(rectify,[],[f36]) ).
fof(f297,plain,
! [X0,X1] :
( ? [X4] :
( rline(X4)
& ron(X0,X4)
& ron(X1,X4) )
| ! [X2] :
( ~ rpoint(X2)
| X0 != X2 )
| ! [X3] :
( ~ rpoint(X3)
| X1 != X3 )
| X0 = X1 ),
inference(ennf_transformation,[],[f153]) ).
fof(f298,plain,
! [X0,X1] :
( ? [X4] :
( rline(X4)
& ron(X0,X4)
& ron(X1,X4) )
| ! [X2] :
( ~ rpoint(X2)
| X0 != X2 )
| ! [X3] :
( ~ rpoint(X3)
| X1 != X3 )
| X0 = X1 ),
inference(flattening,[],[f297]) ).
fof(f466,plain,
( rpoint(sK1)
& vd1399 = sK1
& rpoint(sK2)
& vd1400 = sK2
& rpoint(sK3)
& vd1401 = sK3
& vd1399 != vd1400
& vd1399 != vd1401
& vd1401 != vd1400
& rline(vd1407)
& ron(vd1399,vd1406)
& ron(vd1400,vd1406)
& vd1406 = vd1407 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f126,f465,f464,f463]) ).
fof(f483,plain,
! [X0,X1] :
( ? [X2] :
( rline(X2)
& ron(X0,X2)
& ron(X1,X2) )
| ! [X3] :
( ~ rpoint(X3)
| X0 != X3 )
| ! [X4] :
( ~ rpoint(X4)
| X1 != X4 )
| X0 = X1 ),
inference(rectify,[],[f298]) ).
fof(f485,plain,
! [X0,X1] :
( ( rline(sK8(X0,X1))
& ron(X0,sK8(X0,X1))
& ron(X1,sK8(X0,X1)) )
| ! [X3] :
( ~ rpoint(X3)
| X0 != X3 )
| ! [X4] :
( ~ rpoint(X4)
| X1 != X4 )
| X0 = X1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f483,f484]) ).
fof(f598,plain,
vd1399 != vd1401,
inference(cnf_transformation,[],[f466]) ).
fof(f600,plain,
vd1401 = sK3,
inference(cnf_transformation,[],[f466]) ).
fof(f601,plain,
rpoint(sK3),
inference(cnf_transformation,[],[f466]) ).
fof(f604,plain,
vd1399 = sK1,
inference(cnf_transformation,[],[f466]) ).
fof(f605,plain,
rpoint(sK1),
inference(cnf_transformation,[],[f466]) ).
fof(f648,plain,
! [X3,X0,X1,X4] :
( ron(X1,sK8(X0,X1))
| ~ rpoint(X3)
| X0 != X3
| ~ rpoint(X4)
| X1 != X4
| X0 = X1 ),
inference(cnf_transformation,[],[f485]) ).
fof(f649,plain,
! [X3,X0,X1,X4] :
( ron(X0,sK8(X0,X1))
| ~ rpoint(X3)
| X0 != X3
| ~ rpoint(X4)
| X1 != X4
| X0 = X1 ),
inference(cnf_transformation,[],[f485]) ).
fof(f650,plain,
! [X3,X0,X1,X4] :
( rline(sK8(X0,X1))
| ~ rpoint(X3)
| X0 != X3
| ~ rpoint(X4)
| X1 != X4
| X0 = X1 ),
inference(cnf_transformation,[],[f485]) ).
fof(f861,plain,
sK1 != sK3,
inference(definition_unfolding,[],[f598,f604,f600]) ).
fof(f1042,plain,
! [X3,X1,X4] :
( rline(sK8(X3,X1))
| ~ rpoint(X3)
| ~ rpoint(X4)
| X1 != X4
| X1 = X3 ),
inference(equality_resolution,[],[f650]) ).
fof(f1043,plain,
! [X3,X4] :
( rline(sK8(X3,X4))
| ~ rpoint(X3)
| ~ rpoint(X4)
| X3 = X4 ),
inference(equality_resolution,[],[f1042]) ).
fof(f1044,plain,
! [X3,X1,X4] :
( ron(X3,sK8(X3,X1))
| ~ rpoint(X3)
| ~ rpoint(X4)
| X1 != X4
| X1 = X3 ),
inference(equality_resolution,[],[f649]) ).
fof(f1046,plain,
! [X3,X1,X4] :
( ron(X1,sK8(X3,X1))
| ~ rpoint(X3)
| ~ rpoint(X4)
| X1 != X4
| X1 = X3 ),
inference(equality_resolution,[],[f648]) ).
fof(f1047,plain,
! [X3,X4] :
( ron(X4,sK8(X3,X4))
| ~ rpoint(X3)
| ~ rpoint(X4)
| X3 = X4 ),
inference(equality_resolution,[],[f1046]) ).
cnf(c_56,plain,
rpoint(sK1),
inference(cnf_transformation,[],[f605]) ).
cnf(c_58,plain,
rpoint(sK3),
inference(cnf_transformation,[],[f601]) ).
cnf(c_60,plain,
sK3 != sK1,
inference(cnf_transformation,[],[f861]) ).
cnf(c_107,plain,
( ~ rpoint(X0)
| ~ rpoint(X1)
| X0 = X1
| rline(sK8(X0,X1)) ),
inference(cnf_transformation,[],[f1043]) ).
cnf(c_109,plain,
( ~ rpoint(X0)
| ~ rpoint(X1)
| X0 = X1
| ron(X1,sK8(X0,X1)) ),
inference(cnf_transformation,[],[f1047]) ).
cnf(c_25040,plain,
( ~ rpoint(sK3)
| ~ rpoint(sK1)
| sK3 = sK1
| rline(sK8(sK3,sK1)) ),
inference(instantiation,[status(thm)],[c_107]) ).
cnf(c_26095,plain,
( ~ ron(sK1,sK8(sK3,X0))
| ~ rline(sK8(sK3,X0))
| ~ rpoint(X0)
| X0 = sK3 ),
inference(forward_subsumption_resolution,[status(thm)],[c_26087,c_58]) ).
cnf(c_26296,plain,
( ~ rline(sK8(sK3,sK1))
| ~ rpoint(sK3)
| ~ rpoint(sK1)
| sK3 = sK1 ),
inference(superposition,[status(thm)],[c_109,c_26095]) ).
cnf(c_26297,plain,
~ rline(sK8(sK3,sK1)),
inference(forward_subsumption_resolution,[status(thm)],[c_26296,c_60,c_56,c_58]) ).
cnf(c_26298,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_26297,c_25040,c_60,c_56,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO342+1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n023.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:52:40 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
% 9.93/2.15 % SZS status Started for theBenchmark.p
% 9.93/2.15 % SZS status Theorem for theBenchmark.p
% 9.93/2.15
% 9.93/2.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 9.93/2.15
% 9.93/2.15 ------ iProver source info
% 9.93/2.15
% 9.93/2.15 git: date: 2023-05-31 18:12:56 +0000
% 9.93/2.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 9.93/2.15 git: non_committed_changes: false
% 9.93/2.15 git: last_make_outside_of_git: false
% 9.93/2.15
% 9.93/2.15 ------ Parsing...
% 9.93/2.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 9.93/2.15
% 9.93/2.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 9.93/2.15
% 9.93/2.15 ------ Preprocessing... gs_s sp: 14 0s gs_e snvd_s sp: 0 0s snvd_e
% 9.93/2.15
% 9.93/2.15 ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 9.93/2.15 ------ Proving...
% 9.93/2.15 ------ Problem Properties
% 9.93/2.15
% 9.93/2.15
% 9.93/2.15 clauses 269
% 9.93/2.15 conjectures 1
% 9.93/2.15 EPR 66
% 9.93/2.15 Horn 173
% 9.93/2.15 unary 17
% 9.93/2.15 binary 42
% 9.93/2.15 lits 1699
% 9.93/2.15 lits eq 283
% 9.93/2.15 fd_pure 0
% 9.93/2.15 fd_pseudo 0
% 9.93/2.15 fd_cond 0
% 9.93/2.15 fd_pseudo_cond 65
% 9.93/2.15 AC symbols 0
% 9.93/2.15
% 9.93/2.15 ------ Schedule dynamic 5 is on
% 9.93/2.15
% 9.93/2.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 9.93/2.15
% 9.93/2.15
% 9.93/2.15 ------
% 9.93/2.15 Current options:
% 9.93/2.15 ------
% 9.93/2.15
% 9.93/2.15
% 9.93/2.15
% 9.93/2.15
% 9.93/2.15 ------ Proving...
% 9.93/2.15
% 9.93/2.15
% 9.93/2.15 % SZS status Theorem for theBenchmark.p
% 9.93/2.15
% 9.93/2.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.93/2.15
% 9.93/2.16
%------------------------------------------------------------------------------