TSTP Solution File: COM141+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : COM141+1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:10:39 EDT 2024
% Result : Theorem 3.76s 1.15s
% Output : CNFRefutation 3.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 11 unt; 0 def)
% Number of atoms : 92 ( 37 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 95 ( 37 ~; 29 |; 21 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 119 ( 4 sgn 83 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f56,axiom,
! [X8,X9,X19,X20,X34,X14] :
( ( vtcheck(X19,vabs(X20,X34,veabs),X14)
& vnoType = vlookup(X8,X19)
& X8 != X20 )
=> vtcheck(vbind(X8,X9,X19),vabs(X20,X34,veabs),X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','T-Weak-abs-1') ).
fof(f57,axiom,
! [X8,X9,X19,X20,X34,X14] :
( ( vtcheck(X19,vabs(X20,X34,veabs),X14)
& vnoType = vlookup(X8,X19)
& X8 = X20 )
=> vtcheck(vbind(X8,X9,X19),vabs(X20,X34,veabs),X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','T-Weak-abs-2') ).
fof(f58,conjecture,
! [X8,X9,X19,X20,X34,X14] :
( ( vtcheck(X19,vabs(X20,X34,veabs),X14)
& vnoType = vlookup(X8,X19) )
=> vtcheck(vbind(X8,X9,X19),vabs(X20,X34,veabs),X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','T-Weak-abs') ).
fof(f59,negated_conjecture,
~ ! [X8,X9,X19,X20,X34,X14] :
( ( vtcheck(X19,vabs(X20,X34,veabs),X14)
& vnoType = vlookup(X8,X19) )
=> vtcheck(vbind(X8,X9,X19),vabs(X20,X34,veabs),X14) ),
inference(negated_conjecture,[],[f58]) ).
fof(f113,plain,
! [X0,X1,X2,X3,X4,X5] :
( ( vtcheck(X2,vabs(X3,X4,veabs),X5)
& vnoType = vlookup(X0,X2)
& X0 != X3 )
=> vtcheck(vbind(X0,X1,X2),vabs(X3,X4,veabs),X5) ),
inference(rectify,[],[f56]) ).
fof(f114,plain,
! [X0,X1,X2,X3,X4,X5] :
( ( vtcheck(X2,vabs(X3,X4,veabs),X5)
& vnoType = vlookup(X0,X2)
& X0 = X3 )
=> vtcheck(vbind(X0,X1,X2),vabs(X3,X4,veabs),X5) ),
inference(rectify,[],[f57]) ).
fof(f115,plain,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( vtcheck(X2,vabs(X3,X4,veabs),X5)
& vnoType = vlookup(X0,X2) )
=> vtcheck(vbind(X0,X1,X2),vabs(X3,X4,veabs),X5) ),
inference(rectify,[],[f59]) ).
fof(f195,plain,
! [X0,X1,X2,X3,X4,X5] :
( vtcheck(vbind(X0,X1,X2),vabs(X3,X4,veabs),X5)
| ~ vtcheck(X2,vabs(X3,X4,veabs),X5)
| vnoType != vlookup(X0,X2)
| X0 = X3 ),
inference(ennf_transformation,[],[f113]) ).
fof(f196,plain,
! [X0,X1,X2,X3,X4,X5] :
( vtcheck(vbind(X0,X1,X2),vabs(X3,X4,veabs),X5)
| ~ vtcheck(X2,vabs(X3,X4,veabs),X5)
| vnoType != vlookup(X0,X2)
| X0 = X3 ),
inference(flattening,[],[f195]) ).
fof(f197,plain,
! [X0,X1,X2,X3,X4,X5] :
( vtcheck(vbind(X0,X1,X2),vabs(X3,X4,veabs),X5)
| ~ vtcheck(X2,vabs(X3,X4,veabs),X5)
| vnoType != vlookup(X0,X2)
| X0 != X3 ),
inference(ennf_transformation,[],[f114]) ).
fof(f198,plain,
! [X0,X1,X2,X3,X4,X5] :
( vtcheck(vbind(X0,X1,X2),vabs(X3,X4,veabs),X5)
| ~ vtcheck(X2,vabs(X3,X4,veabs),X5)
| vnoType != vlookup(X0,X2)
| X0 != X3 ),
inference(flattening,[],[f197]) ).
fof(f199,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ vtcheck(vbind(X0,X1,X2),vabs(X3,X4,veabs),X5)
& vtcheck(X2,vabs(X3,X4,veabs),X5)
& vnoType = vlookup(X0,X2) ),
inference(ennf_transformation,[],[f115]) ).
fof(f200,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ vtcheck(vbind(X0,X1,X2),vabs(X3,X4,veabs),X5)
& vtcheck(X2,vabs(X3,X4,veabs),X5)
& vnoType = vlookup(X0,X2) ),
inference(flattening,[],[f199]) ).
fof(f288,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( ~ vtcheck(vbind(X0,X1,X2),vabs(X3,X4,veabs),X5)
& vtcheck(X2,vabs(X3,X4,veabs),X5)
& vnoType = vlookup(X0,X2) )
=> ( ~ vtcheck(vbind(sK87,sK88,sK89),vabs(sK90,sK91,veabs),sK92)
& vtcheck(sK89,vabs(sK90,sK91,veabs),sK92)
& vnoType = vlookup(sK87,sK89) ) ),
introduced(choice_axiom,[]) ).
fof(f289,plain,
( ~ vtcheck(vbind(sK87,sK88,sK89),vabs(sK90,sK91,veabs),sK92)
& vtcheck(sK89,vabs(sK90,sK91,veabs),sK92)
& vnoType = vlookup(sK87,sK89) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK87,sK88,sK89,sK90,sK91,sK92])],[f200,f288]) ).
fof(f439,plain,
! [X2,X3,X0,X1,X4,X5] :
( vtcheck(vbind(X0,X1,X2),vabs(X3,X4,veabs),X5)
| ~ vtcheck(X2,vabs(X3,X4,veabs),X5)
| vnoType != vlookup(X0,X2)
| X0 = X3 ),
inference(cnf_transformation,[],[f196]) ).
fof(f440,plain,
! [X2,X3,X0,X1,X4,X5] :
( vtcheck(vbind(X0,X1,X2),vabs(X3,X4,veabs),X5)
| ~ vtcheck(X2,vabs(X3,X4,veabs),X5)
| vnoType != vlookup(X0,X2)
| X0 != X3 ),
inference(cnf_transformation,[],[f198]) ).
fof(f441,plain,
vnoType = vlookup(sK87,sK89),
inference(cnf_transformation,[],[f289]) ).
fof(f442,plain,
vtcheck(sK89,vabs(sK90,sK91,veabs),sK92),
inference(cnf_transformation,[],[f289]) ).
fof(f443,plain,
~ vtcheck(vbind(sK87,sK88,sK89),vabs(sK90,sK91,veabs),sK92),
inference(cnf_transformation,[],[f289]) ).
fof(f555,plain,
! [X2,X3,X1,X4,X5] :
( vtcheck(vbind(X3,X1,X2),vabs(X3,X4,veabs),X5)
| ~ vtcheck(X2,vabs(X3,X4,veabs),X5)
| vnoType != vlookup(X3,X2) ),
inference(equality_resolution,[],[f440]) ).
cnf(c_188,plain,
( vlookup(X0,X1) != vnoType
| ~ vtcheck(X1,vabs(X2,X3,veabs),X4)
| X0 = X2
| vtcheck(vbind(X0,X5,X1),vabs(X2,X3,veabs),X4) ),
inference(cnf_transformation,[],[f439]) ).
cnf(c_189,plain,
( vlookup(X0,X1) != vnoType
| ~ vtcheck(X1,vabs(X0,X2,veabs),X3)
| vtcheck(vbind(X0,X4,X1),vabs(X0,X2,veabs),X3) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_190,negated_conjecture,
~ vtcheck(vbind(sK87,sK88,sK89),vabs(sK90,sK91,veabs),sK92),
inference(cnf_transformation,[],[f443]) ).
cnf(c_191,negated_conjecture,
vtcheck(sK89,vabs(sK90,sK91,veabs),sK92),
inference(cnf_transformation,[],[f442]) ).
cnf(c_192,negated_conjecture,
vlookup(sK87,sK89) = vnoType,
inference(cnf_transformation,[],[f441]) ).
cnf(c_16325,plain,
( ~ vtcheck(sK89,vabs(sK87,X0,veabs),X1)
| vtcheck(vbind(sK87,X2,sK89),vabs(sK87,X0,veabs),X1) ),
inference(superposition,[status(thm)],[c_192,c_189]) ).
cnf(c_16342,plain,
( ~ vtcheck(sK89,vabs(X0,X1,veabs),X2)
| X0 = sK87
| vtcheck(vbind(sK87,X3,sK89),vabs(X0,X1,veabs),X2) ),
inference(superposition,[status(thm)],[c_192,c_188]) ).
cnf(c_16389,plain,
( ~ vtcheck(sK89,vabs(sK90,sK91,veabs),sK92)
| sK87 = sK90 ),
inference(superposition,[status(thm)],[c_16342,c_190]) ).
cnf(c_16518,plain,
sK87 = sK90,
inference(global_subsumption_just,[status(thm)],[c_16389,c_191,c_16389]) ).
cnf(c_16520,plain,
~ vtcheck(vbind(sK87,sK88,sK89),vabs(sK87,sK91,veabs),sK92),
inference(superposition,[status(thm)],[c_16518,c_190]) ).
cnf(c_16521,plain,
vtcheck(sK89,vabs(sK87,sK91,veabs),sK92),
inference(superposition,[status(thm)],[c_16518,c_191]) ).
cnf(c_16693,plain,
~ vtcheck(sK89,vabs(sK87,sK91,veabs),sK92),
inference(superposition,[status(thm)],[c_16325,c_16520]) ).
cnf(c_16695,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_16521,c_16693]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : COM141+1 : TPTP v8.1.2. Released v6.4.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri May 3 00:34:40 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.76/1.15 % SZS status Started for theBenchmark.p
% 3.76/1.15 % SZS status Theorem for theBenchmark.p
% 3.76/1.15
% 3.76/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.76/1.15
% 3.76/1.15 ------ iProver source info
% 3.76/1.15
% 3.76/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.76/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.76/1.15 git: non_committed_changes: false
% 3.76/1.15
% 3.76/1.15 ------ Parsing...
% 3.76/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.76/1.15
% 3.76/1.15 ------ Preprocessing... sup_sim: 1 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
% 3.76/1.15
% 3.76/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.76/1.15
% 3.76/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.76/1.15 ------ Proving...
% 3.76/1.15 ------ Problem Properties
% 3.76/1.15
% 3.76/1.15
% 3.76/1.15 clauses 140
% 3.76/1.15 conjectures 3
% 3.76/1.15 EPR 3
% 3.76/1.15 Horn 113
% 3.76/1.15 unary 26
% 3.76/1.15 binary 86
% 3.76/1.15 lits 306
% 3.76/1.15 lits eq 136
% 3.76/1.15 fd_pure 0
% 3.76/1.15 fd_pseudo 0
% 3.76/1.15 fd_cond 3
% 3.76/1.15 fd_pseudo_cond 21
% 3.76/1.15 AC symbols 0
% 3.76/1.15
% 3.76/1.15 ------ Input Options Time Limit: Unbounded
% 3.76/1.15
% 3.76/1.15
% 3.76/1.15 ------
% 3.76/1.15 Current options:
% 3.76/1.15 ------
% 3.76/1.15
% 3.76/1.15
% 3.76/1.15
% 3.76/1.15
% 3.76/1.15 ------ Proving...
% 3.76/1.15
% 3.76/1.15
% 3.76/1.15 % SZS status Theorem for theBenchmark.p
% 3.76/1.15
% 3.76/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.76/1.15
% 3.76/1.15
%------------------------------------------------------------------------------