TSTP Solution File: PHI010+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : PHI010+1 : TPTP v7.2.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n067.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Tue May 29 12:48:20 EDT 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 7 unt; 0 def)
% Number of atoms : 257 ( 12 equ)
% Maximal formula atoms : 74 ( 7 avg)
% Number of connectives : 369 ( 147 ~; 145 |; 68 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-4 aty)
% Number of variables : 86 ( 2 sgn 43 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( is_the(X1,X2)
=> ( property(X2)
& object(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp9GdXjm/sel_theBenchmark.p_1',description_is_property_and_described_is_object) ).
fof(2,conjecture,
! [X1,X2,X3] :
( ( object(X1)
& property(X2)
& object(X3) )
=> ( ( is_the(X1,X2)
& equal(X1,X3) )
=> exemplifies_property(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp9GdXjm/sel_theBenchmark.p_1',lemma_1) ).
fof(5,axiom,
! [X2,X1,X4] :
( ( property(X2)
& object(X1)
& object(X4) )
=> ( ( is_the(X1,X2)
& equal(X1,X4) )
<=> ? [X3] :
( object(X3)
& exemplifies_property(X2,X3)
& ! [X5] :
( object(X5)
=> ( exemplifies_property(X2,X5)
=> equal(X5,X3) ) )
& equal(X3,X4) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp9GdXjm/sel_theBenchmark.p_1',description_axiom_identity_instance) ).
fof(6,negated_conjecture,
~ ! [X1,X2,X3] :
( ( object(X1)
& property(X2)
& object(X3) )
=> ( ( is_the(X1,X2)
& equal(X1,X3) )
=> exemplifies_property(X2,X3) ) ),
inference(assume_negation,[status(cth)],[2]) ).
fof(8,plain,
! [X1,X2] :
( ~ is_the(X1,X2)
| ( property(X2)
& object(X1) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(9,plain,
! [X3,X4] :
( ~ is_the(X3,X4)
| ( property(X4)
& object(X3) ) ),
inference(variable_rename,[status(thm)],[8]) ).
fof(10,plain,
! [X3,X4] :
( ( property(X4)
| ~ is_the(X3,X4) )
& ( object(X3)
| ~ is_the(X3,X4) ) ),
inference(distribute,[status(thm)],[9]) ).
cnf(11,plain,
( object(X1)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(12,plain,
( property(X2)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[10]) ).
fof(13,negated_conjecture,
? [X1,X2,X3] :
( object(X1)
& property(X2)
& object(X3)
& is_the(X1,X2)
& equal(X1,X3)
& ~ exemplifies_property(X2,X3) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(14,negated_conjecture,
? [X4,X5,X6] :
( object(X4)
& property(X5)
& object(X6)
& is_the(X4,X5)
& equal(X4,X6)
& ~ exemplifies_property(X5,X6) ),
inference(variable_rename,[status(thm)],[13]) ).
fof(15,negated_conjecture,
( object(esk1_0)
& property(esk2_0)
& object(esk3_0)
& is_the(esk1_0,esk2_0)
& equal(esk1_0,esk3_0)
& ~ exemplifies_property(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[14]) ).
cnf(16,negated_conjecture,
~ exemplifies_property(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(17,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[15]) ).
cnf(18,negated_conjecture,
is_the(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[15]) ).
fof(30,plain,
! [X2,X1,X4] :
( ~ property(X2)
| ~ object(X1)
| ~ object(X4)
| ( ( ~ is_the(X1,X2)
| ~ equal(X1,X4)
| ? [X3] :
( object(X3)
& exemplifies_property(X2,X3)
& ! [X5] :
( ~ object(X5)
| ~ exemplifies_property(X2,X5)
| equal(X5,X3) )
& equal(X3,X4) ) )
& ( ! [X3] :
( ~ object(X3)
| ~ exemplifies_property(X2,X3)
| ? [X5] :
( object(X5)
& exemplifies_property(X2,X5)
& ~ equal(X5,X3) )
| ~ equal(X3,X4) )
| ( is_the(X1,X2)
& equal(X1,X4) ) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(31,plain,
! [X6,X7,X8] :
( ~ property(X6)
| ~ object(X7)
| ~ object(X8)
| ( ( ~ is_the(X7,X6)
| ~ equal(X7,X8)
| ? [X9] :
( object(X9)
& exemplifies_property(X6,X9)
& ! [X10] :
( ~ object(X10)
| ~ exemplifies_property(X6,X10)
| equal(X10,X9) )
& equal(X9,X8) ) )
& ( ! [X11] :
( ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ? [X12] :
( object(X12)
& exemplifies_property(X6,X12)
& ~ equal(X12,X11) )
| ~ equal(X11,X8) )
| ( is_the(X7,X6)
& equal(X7,X8) ) ) ) ),
inference(variable_rename,[status(thm)],[30]) ).
fof(32,plain,
! [X6,X7,X8] :
( ~ property(X6)
| ~ object(X7)
| ~ object(X8)
| ( ( ~ is_the(X7,X6)
| ~ equal(X7,X8)
| ( object(esk4_3(X6,X7,X8))
& exemplifies_property(X6,esk4_3(X6,X7,X8))
& ! [X10] :
( ~ object(X10)
| ~ exemplifies_property(X6,X10)
| equal(X10,esk4_3(X6,X7,X8)) )
& equal(esk4_3(X6,X7,X8),X8) ) )
& ( ! [X11] :
( ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ( object(esk5_4(X6,X7,X8,X11))
& exemplifies_property(X6,esk5_4(X6,X7,X8,X11))
& ~ equal(esk5_4(X6,X7,X8,X11),X11) )
| ~ equal(X11,X8) )
| ( is_the(X7,X6)
& equal(X7,X8) ) ) ) ),
inference(skolemize,[status(esa)],[31]) ).
fof(33,plain,
! [X6,X7,X8,X10,X11] :
( ( ( ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ( object(esk5_4(X6,X7,X8,X11))
& exemplifies_property(X6,esk5_4(X6,X7,X8,X11))
& ~ equal(esk5_4(X6,X7,X8,X11),X11) )
| ~ equal(X11,X8)
| ( is_the(X7,X6)
& equal(X7,X8) ) )
& ( ( ( ~ object(X10)
| ~ exemplifies_property(X6,X10)
| equal(X10,esk4_3(X6,X7,X8)) )
& object(esk4_3(X6,X7,X8))
& exemplifies_property(X6,esk4_3(X6,X7,X8))
& equal(esk4_3(X6,X7,X8),X8) )
| ~ is_the(X7,X6)
| ~ equal(X7,X8) ) )
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) ),
inference(shift_quantors,[status(thm)],[32]) ).
fof(34,plain,
! [X6,X7,X8,X10,X11] :
( ( is_the(X7,X6)
| object(esk5_4(X6,X7,X8,X11))
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ~ equal(X11,X8)
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( equal(X7,X8)
| object(esk5_4(X6,X7,X8,X11))
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ~ equal(X11,X8)
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( is_the(X7,X6)
| exemplifies_property(X6,esk5_4(X6,X7,X8,X11))
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ~ equal(X11,X8)
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( equal(X7,X8)
| exemplifies_property(X6,esk5_4(X6,X7,X8,X11))
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ~ equal(X11,X8)
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( is_the(X7,X6)
| ~ equal(esk5_4(X6,X7,X8,X11),X11)
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ~ equal(X11,X8)
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( equal(X7,X8)
| ~ equal(esk5_4(X6,X7,X8,X11),X11)
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ~ equal(X11,X8)
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( ~ object(X10)
| ~ exemplifies_property(X6,X10)
| equal(X10,esk4_3(X6,X7,X8))
| ~ is_the(X7,X6)
| ~ equal(X7,X8)
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( object(esk4_3(X6,X7,X8))
| ~ is_the(X7,X6)
| ~ equal(X7,X8)
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( exemplifies_property(X6,esk4_3(X6,X7,X8))
| ~ is_the(X7,X6)
| ~ equal(X7,X8)
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) )
& ( equal(esk4_3(X6,X7,X8),X8)
| ~ is_the(X7,X6)
| ~ equal(X7,X8)
| ~ property(X6)
| ~ object(X7)
| ~ object(X8) ) ),
inference(distribute,[status(thm)],[33]) ).
cnf(35,plain,
( esk4_3(X3,X2,X1) = X1
| ~ object(X1)
| ~ object(X2)
| ~ property(X3)
| X2 != X1
| ~ is_the(X2,X3) ),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(36,plain,
( exemplifies_property(X3,esk4_3(X3,X2,X1))
| ~ object(X1)
| ~ object(X2)
| ~ property(X3)
| X2 != X1
| ~ is_the(X2,X3) ),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(49,negated_conjecture,
~ exemplifies_property(esk2_0,esk1_0),
inference(rw,[status(thm)],[16,17,theory(equality)]) ).
cnf(56,plain,
( esk4_3(X3,X2,X1) = X1
| X1 != X2
| ~ object(X1)
| ~ property(X3)
| ~ is_the(X2,X3) ),
inference(csr,[status(thm)],[35,11]) ).
cnf(57,plain,
( esk4_3(X3,X2,X1) = X1
| X1 != X2
| ~ object(X1)
| ~ is_the(X2,X3) ),
inference(csr,[status(thm)],[56,12]) ).
cnf(58,plain,
( esk4_3(X1,X2,X2) = X2
| ~ object(X2)
| ~ is_the(X2,X1) ),
inference(er,[status(thm)],[57,theory(equality)]) ).
cnf(59,plain,
( exemplifies_property(X3,esk4_3(X3,X2,X1))
| X1 != X2
| ~ object(X1)
| ~ property(X3)
| ~ is_the(X2,X3) ),
inference(csr,[status(thm)],[36,11]) ).
cnf(60,plain,
( exemplifies_property(X3,esk4_3(X3,X2,X1))
| X1 != X2
| ~ object(X1)
| ~ is_the(X2,X3) ),
inference(csr,[status(thm)],[59,12]) ).
cnf(61,plain,
( exemplifies_property(X1,esk4_3(X1,X2,X2))
| ~ object(X2)
| ~ is_the(X2,X1) ),
inference(er,[status(thm)],[60,theory(equality)]) ).
cnf(85,plain,
( esk4_3(X1,X2,X2) = X2
| ~ is_the(X2,X1) ),
inference(csr,[status(thm)],[58,11]) ).
cnf(87,plain,
( exemplifies_property(X1,esk4_3(X1,X2,X2))
| ~ is_the(X2,X1) ),
inference(csr,[status(thm)],[61,11]) ).
cnf(90,plain,
( exemplifies_property(X1,X2)
| ~ is_the(X2,X1) ),
inference(spm,[status(thm)],[87,85,theory(equality)]) ).
cnf(93,negated_conjecture,
exemplifies_property(esk2_0,esk1_0),
inference(spm,[status(thm)],[90,18,theory(equality)]) ).
cnf(94,negated_conjecture,
$false,
inference(sr,[status(thm)],[93,49,theory(equality)]) ).
cnf(95,negated_conjecture,
$false,
94,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI010+1 : TPTP v7.2.0. Released v7.2.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.24 % Computer : n067.star.cs.uiowa.edu
% 0.02/0.24 % Model : x86_64 x86_64
% 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.24 % Memory : 32218.625MB
% 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.24 % CPULimit : 300
% 0.02/0.24 % DateTime : Tue May 29 11:00:59 CDT 2018
% 0.02/0.24 % CPUTime :
% 0.07/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.28 --creating new selector for []
% 0.07/0.36 -running prover on /export/starexec/sandbox2/tmp/tmp9GdXjm/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.36 -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/tmp9GdXjm/sel_theBenchmark.p_1']
% 0.07/0.36 -prover status Theorem
% 0.07/0.36 Problem theBenchmark.p solved in phase 0.
% 0.07/0.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.36 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.36 Solved 1 out of 1.
% 0.07/0.36 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.36 # SZS status Theorem
% 0.07/0.36 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.37 # SZS output end CNFRefutation
%------------------------------------------------------------------------------