TSTP Solution File: COM141+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : COM141+1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n001.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 16091.75MB
% OS : Linux 3.10.0-327.10.1.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Mar 28 10:03:42 EDT 2016
% Result : Theorem 0.10s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 61 ( 7 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 65 ( 26 ~; 23 |; 12 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 78 ( 3 sgn 48 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(15,axiom,
! [X2,X19,X1,X3,X20,X15] :
( ( ~ equal(X2,X3)
& equal(vlookup(X2,X1),vnoType)
& vtcheck(X1,vabs(X3,X20,veabs),X15) )
=> vtcheck(vbind(X2,X19,X1),vabs(X3,X20,veabs),X15) ),
file('/export/starexec/sandbox2/tmp/tmpcTCyk6/sel_theBenchmark.p_1','T-Weak-abs-1') ).
fof(16,axiom,
! [X2,X19,X1,X3,X20,X15] :
( ( equal(X2,X3)
& equal(vlookup(X2,X1),vnoType)
& vtcheck(X1,vabs(X3,X20,veabs),X15) )
=> vtcheck(vbind(X2,X19,X1),vabs(X3,X20,veabs),X15) ),
file('/export/starexec/sandbox2/tmp/tmpcTCyk6/sel_theBenchmark.p_1','T-Weak-abs-2') ).
fof(17,conjecture,
! [X2,X19,X1,X3,X20,X15] :
( ( equal(vlookup(X2,X1),vnoType)
& vtcheck(X1,vabs(X3,X20,veabs),X15) )
=> vtcheck(vbind(X2,X19,X1),vabs(X3,X20,veabs),X15) ),
file('/export/starexec/sandbox2/tmp/tmpcTCyk6/sel_theBenchmark.p_1','T-Weak-abs') ).
fof(19,negated_conjecture,
~ ! [X2,X19,X1,X3,X20,X15] :
( ( equal(vlookup(X2,X1),vnoType)
& vtcheck(X1,vabs(X3,X20,veabs),X15) )
=> vtcheck(vbind(X2,X19,X1),vabs(X3,X20,veabs),X15) ),
inference(assume_negation,[status(cth)],[17]) ).
fof(71,plain,
! [X2,X19,X1,X3,X20,X15] :
( equal(X2,X3)
| ~ equal(vlookup(X2,X1),vnoType)
| ~ vtcheck(X1,vabs(X3,X20,veabs),X15)
| vtcheck(vbind(X2,X19,X1),vabs(X3,X20,veabs),X15) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(72,plain,
! [X21,X22,X23,X24,X25,X26] :
( equal(X21,X24)
| ~ equal(vlookup(X21,X23),vnoType)
| ~ vtcheck(X23,vabs(X24,X25,veabs),X26)
| vtcheck(vbind(X21,X22,X23),vabs(X24,X25,veabs),X26) ),
inference(variable_rename,[status(thm)],[71]) ).
cnf(73,plain,
( vtcheck(vbind(X1,X2,X3),vabs(X4,X5,veabs),X6)
| X1 = X4
| ~ vtcheck(X3,vabs(X4,X5,veabs),X6)
| vlookup(X1,X3) != vnoType ),
inference(split_conjunct,[status(thm)],[72]) ).
fof(74,plain,
! [X2,X19,X1,X3,X20,X15] :
( ~ equal(X2,X3)
| ~ equal(vlookup(X2,X1),vnoType)
| ~ vtcheck(X1,vabs(X3,X20,veabs),X15)
| vtcheck(vbind(X2,X19,X1),vabs(X3,X20,veabs),X15) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(75,plain,
! [X21,X22,X23,X24,X25,X26] :
( ~ equal(X21,X24)
| ~ equal(vlookup(X21,X23),vnoType)
| ~ vtcheck(X23,vabs(X24,X25,veabs),X26)
| vtcheck(vbind(X21,X22,X23),vabs(X24,X25,veabs),X26) ),
inference(variable_rename,[status(thm)],[74]) ).
cnf(76,plain,
( vtcheck(vbind(X1,X2,X3),vabs(X4,X5,veabs),X6)
| ~ vtcheck(X3,vabs(X4,X5,veabs),X6)
| vlookup(X1,X3) != vnoType
| X1 != X4 ),
inference(split_conjunct,[status(thm)],[75]) ).
fof(77,negated_conjecture,
? [X2,X19,X1,X3,X20,X15] :
( equal(vlookup(X2,X1),vnoType)
& vtcheck(X1,vabs(X3,X20,veabs),X15)
& ~ vtcheck(vbind(X2,X19,X1),vabs(X3,X20,veabs),X15) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(78,negated_conjecture,
? [X21,X22,X23,X24,X25,X26] :
( equal(vlookup(X21,X23),vnoType)
& vtcheck(X23,vabs(X24,X25,veabs),X26)
& ~ vtcheck(vbind(X21,X22,X23),vabs(X24,X25,veabs),X26) ),
inference(variable_rename,[status(thm)],[77]) ).
fof(79,negated_conjecture,
( equal(vlookup(esk1_0,esk3_0),vnoType)
& vtcheck(esk3_0,vabs(esk4_0,esk5_0,veabs),esk6_0)
& ~ vtcheck(vbind(esk1_0,esk2_0,esk3_0),vabs(esk4_0,esk5_0,veabs),esk6_0) ),
inference(skolemize,[status(esa)],[78]) ).
cnf(80,negated_conjecture,
~ vtcheck(vbind(esk1_0,esk2_0,esk3_0),vabs(esk4_0,esk5_0,veabs),esk6_0),
inference(split_conjunct,[status(thm)],[79]) ).
cnf(81,negated_conjecture,
vtcheck(esk3_0,vabs(esk4_0,esk5_0,veabs),esk6_0),
inference(split_conjunct,[status(thm)],[79]) ).
cnf(82,negated_conjecture,
vlookup(esk1_0,esk3_0) = vnoType,
inference(split_conjunct,[status(thm)],[79]) ).
cnf(104,plain,
( vtcheck(vbind(X1,X2,X3),vabs(X4,X5,veabs),X6)
| vlookup(X1,X3) != vnoType
| ~ vtcheck(X3,vabs(X4,X5,veabs),X6) ),
inference(csr,[status(thm)],[76,73]) ).
cnf(105,negated_conjecture,
( vlookup(esk1_0,esk3_0) != vnoType
| ~ vtcheck(esk3_0,vabs(esk4_0,esk5_0,veabs),esk6_0) ),
inference(spm,[status(thm)],[80,104,theory(equality)]) ).
cnf(106,negated_conjecture,
( $false
| ~ vtcheck(esk3_0,vabs(esk4_0,esk5_0,veabs),esk6_0) ),
inference(rw,[status(thm)],[105,82,theory(equality)]) ).
cnf(107,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[106,81,theory(equality)]) ).
cnf(108,negated_conjecture,
$false,
inference(cn,[status(thm)],[107,theory(equality)]) ).
cnf(109,negated_conjecture,
$false,
108,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM141+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.22 % Computer : n001.star.cs.uiowa.edu
% 0.03/0.22 % Model : x86_64 x86_64
% 0.03/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.22 % Memory : 16091.75MB
% 0.03/0.22 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.03/0.22 % CPULimit : 300
% 0.03/0.22 % DateTime : Fri Mar 25 12:16:13 CDT 2016
% 0.03/0.22 % CPUTime :
% 0.08/0.71 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.71 --creating new selector for [COM001+0.ax]
% 0.10/0.80 -running prover on /export/starexec/sandbox2/tmp/tmpcTCyk6/sel_theBenchmark.p_1 with time limit 29
% 0.10/0.80 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpcTCyk6/sel_theBenchmark.p_1']
% 0.10/0.80 -prover status Theorem
% 0.10/0.80 Problem theBenchmark.p solved in phase 0.
% 0.10/0.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.80 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.80 Solved 1 out of 1.
% 0.10/0.80 # Problem is unsatisfiable (or provable), constructing proof object
% 0.10/0.80 # SZS status Theorem
% 0.10/0.80 # SZS output start CNFRefutation.
% See solution above
% 0.10/0.81 # SZS output end CNFRefutation
%------------------------------------------------------------------------------