TSTP Solution File: CSR018+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR018+1 : TPTP v5.0.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 06:00:03 EST 2010
% Result : Theorem 0.55s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 65 ( 17 unt; 0 def)
% Number of atoms : 482 ( 258 equ)
% Maximal formula atoms : 120 ( 7 avg)
% Number of connectives : 606 ( 189 ~; 281 |; 125 &)
% ( 10 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 101 ( 1 sgn 68 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X3,X2] :
( initiates(X1,X3,X2)
<=> ( ( X1 = push
& X3 = forwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = backwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = spinning
& happens(push,X2) ) ) ),
file('/tmp/tmpBE-3qO/sel_CSR018+1.p_1',initiates_all_defn) ).
fof(6,axiom,
push != pull,
file('/tmp/tmpBE-3qO/sel_CSR018+1.p_1',push_not_pull) ).
fof(10,axiom,
! [X1,X2] :
( happens(X1,X2)
<=> ( ( X1 = push
& X2 = n0 )
| ( X1 = pull
& X2 = n1 )
| ( X1 = pull
& X2 = n2 )
| ( X1 = push
& X2 = n2 ) ) ),
file('/tmp/tmpBE-3qO/sel_CSR018+1.p_1',happens_all_defn) ).
fof(11,axiom,
! [X1,X2,X3] :
( ( happens(X1,X2)
& initiates(X1,X3,X2) )
=> holdsAt(X3,plus(X2,n1)) ),
file('/tmp/tmpBE-3qO/sel_CSR018+1.p_1',happens_holds) ).
fof(16,axiom,
plus(n1,n1) = n2,
file('/tmp/tmpBE-3qO/sel_CSR018+1.p_1',plus1_1) ).
fof(27,axiom,
! [X4,X5] :
( less(X4,X5)
<=> ( ~ less(X5,X4)
& X5 != X4 ) ),
file('/tmp/tmpBE-3qO/sel_CSR018+1.p_1',less_property) ).
fof(29,conjecture,
holdsAt(backwards,n2),
file('/tmp/tmpBE-3qO/sel_CSR018+1.p_1',backwards_2) ).
fof(30,axiom,
! [X4,X5] :
( less_or_equal(X4,X5)
<=> ( less(X4,X5)
| X4 = X5 ) ),
file('/tmp/tmpBE-3qO/sel_CSR018+1.p_1',less_or_equal) ).
fof(39,axiom,
! [X4] :
( less(X4,n1)
<=> less_or_equal(X4,n0) ),
file('/tmp/tmpBE-3qO/sel_CSR018+1.p_1',less1) ).
fof(40,axiom,
! [X4] :
( less(X4,n2)
<=> less_or_equal(X4,n1) ),
file('/tmp/tmpBE-3qO/sel_CSR018+1.p_1',less2) ).
fof(42,negated_conjecture,
~ holdsAt(backwards,n2),
inference(assume_negation,[status(cth)],[29]) ).
fof(44,plain,
! [X1,X3,X2] :
( initiates(X1,X3,X2)
<=> ( ( X1 = push
& X3 = forwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = backwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = spinning
& happens(push,X2) ) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(52,plain,
! [X4,X5] :
( less(X4,X5)
<=> ( ~ less(X5,X4)
& X5 != X4 ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(53,negated_conjecture,
~ holdsAt(backwards,n2),
inference(fof_simplification,[status(thm)],[42,theory(equality)]) ).
fof(55,plain,
! [X1,X3,X2] :
( epred1_3(X2,X3,X1)
<=> ( ( X1 = push
& X3 = forwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = backwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = spinning
& happens(push,X2) ) ) ),
introduced(definition) ).
fof(58,plain,
! [X1,X3,X2] :
( initiates(X1,X3,X2)
<=> epred1_3(X2,X3,X1) ),
inference(apply_def,[status(esa)],[44,55,theory(equality)]) ).
fof(64,plain,
! [X1,X3,X2] :
( ( ~ initiates(X1,X3,X2)
| epred1_3(X2,X3,X1) )
& ( ~ epred1_3(X2,X3,X1)
| initiates(X1,X3,X2) ) ),
inference(fof_nnf,[status(thm)],[58]) ).
fof(65,plain,
! [X4,X5,X6] :
( ( ~ initiates(X4,X5,X6)
| epred1_3(X6,X5,X4) )
& ( ~ epred1_3(X6,X5,X4)
| initiates(X4,X5,X6) ) ),
inference(variable_rename,[status(thm)],[64]) ).
cnf(66,plain,
( initiates(X1,X2,X3)
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(74,plain,
push != pull,
inference(split_conjunct,[status(thm)],[6]) ).
fof(92,plain,
! [X1,X2] :
( ( ~ happens(X1,X2)
| ( X1 = push
& X2 = n0 )
| ( X1 = pull
& X2 = n1 )
| ( X1 = pull
& X2 = n2 )
| ( X1 = push
& X2 = n2 ) )
& ( ( ( X1 != push
| X2 != n0 )
& ( X1 != pull
| X2 != n1 )
& ( X1 != pull
| X2 != n2 )
& ( X1 != push
| X2 != n2 ) )
| happens(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(93,plain,
! [X3,X4] :
( ( ~ happens(X3,X4)
| ( X3 = push
& X4 = n0 )
| ( X3 = pull
& X4 = n1 )
| ( X3 = pull
& X4 = n2 )
| ( X3 = push
& X4 = n2 ) )
& ( ( ( X3 != push
| X4 != n0 )
& ( X3 != pull
| X4 != n1 )
& ( X3 != pull
| X4 != n2 )
& ( X3 != push
| X4 != n2 ) )
| happens(X3,X4) ) ),
inference(variable_rename,[status(thm)],[92]) ).
fof(94,plain,
! [X3,X4] :
( ( X3 = push
| X3 = pull
| X3 = pull
| X3 = push
| ~ happens(X3,X4) )
& ( X4 = n2
| X3 = pull
| X3 = pull
| X3 = push
| ~ happens(X3,X4) )
& ( X3 = push
| X4 = n2
| X3 = pull
| X3 = push
| ~ happens(X3,X4) )
& ( X4 = n2
| X4 = n2
| X3 = pull
| X3 = push
| ~ happens(X3,X4) )
& ( X3 = push
| X3 = pull
| X4 = n1
| X3 = push
| ~ happens(X3,X4) )
& ( X4 = n2
| X3 = pull
| X4 = n1
| X3 = push
| ~ happens(X3,X4) )
& ( X3 = push
| X4 = n2
| X4 = n1
| X3 = push
| ~ happens(X3,X4) )
& ( X4 = n2
| X4 = n2
| X4 = n1
| X3 = push
| ~ happens(X3,X4) )
& ( X3 = push
| X3 = pull
| X3 = pull
| X4 = n0
| ~ happens(X3,X4) )
& ( X4 = n2
| X3 = pull
| X3 = pull
| X4 = n0
| ~ happens(X3,X4) )
& ( X3 = push
| X4 = n2
| X3 = pull
| X4 = n0
| ~ happens(X3,X4) )
& ( X4 = n2
| X4 = n2
| X3 = pull
| X4 = n0
| ~ happens(X3,X4) )
& ( X3 = push
| X3 = pull
| X4 = n1
| X4 = n0
| ~ happens(X3,X4) )
& ( X4 = n2
| X3 = pull
| X4 = n1
| X4 = n0
| ~ happens(X3,X4) )
& ( X3 = push
| X4 = n2
| X4 = n1
| X4 = n0
| ~ happens(X3,X4) )
& ( X4 = n2
| X4 = n2
| X4 = n1
| X4 = n0
| ~ happens(X3,X4) )
& ( X3 != push
| X4 != n0
| happens(X3,X4) )
& ( X3 != pull
| X4 != n1
| happens(X3,X4) )
& ( X3 != pull
| X4 != n2
| happens(X3,X4) )
& ( X3 != push
| X4 != n2
| happens(X3,X4) ) ),
inference(distribute,[status(thm)],[93]) ).
cnf(97,plain,
( happens(X1,X2)
| X2 != n1
| X1 != pull ),
inference(split_conjunct,[status(thm)],[94]) ).
cnf(103,plain,
( X2 = n0
| X1 = pull
| X2 = n2
| X2 = n2
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[94]) ).
fof(115,plain,
! [X1,X2,X3] :
( ~ happens(X1,X2)
| ~ initiates(X1,X3,X2)
| holdsAt(X3,plus(X2,n1)) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(116,plain,
! [X4,X5,X6] :
( ~ happens(X4,X5)
| ~ initiates(X4,X6,X5)
| holdsAt(X6,plus(X5,n1)) ),
inference(variable_rename,[status(thm)],[115]) ).
cnf(117,plain,
( holdsAt(X1,plus(X2,n1))
| ~ initiates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(split_conjunct,[status(thm)],[116]) ).
cnf(127,plain,
plus(n1,n1) = n2,
inference(split_conjunct,[status(thm)],[16]) ).
fof(139,plain,
! [X4,X5] :
( ( ~ less(X4,X5)
| ( ~ less(X5,X4)
& X5 != X4 ) )
& ( less(X5,X4)
| X5 = X4
| less(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[52]) ).
fof(140,plain,
! [X6,X7] :
( ( ~ less(X6,X7)
| ( ~ less(X7,X6)
& X7 != X6 ) )
& ( less(X7,X6)
| X7 = X6
| less(X6,X7) ) ),
inference(variable_rename,[status(thm)],[139]) ).
fof(141,plain,
! [X6,X7] :
( ( ~ less(X7,X6)
| ~ less(X6,X7) )
& ( X7 != X6
| ~ less(X6,X7) )
& ( less(X7,X6)
| X7 = X6
| less(X6,X7) ) ),
inference(distribute,[status(thm)],[140]) ).
cnf(143,plain,
( ~ less(X1,X2)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(147,negated_conjecture,
~ holdsAt(backwards,n2),
inference(split_conjunct,[status(thm)],[53]) ).
fof(148,plain,
! [X4,X5] :
( ( ~ less_or_equal(X4,X5)
| less(X4,X5)
| X4 = X5 )
& ( ( ~ less(X4,X5)
& X4 != X5 )
| less_or_equal(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(149,plain,
! [X6,X7] :
( ( ~ less_or_equal(X6,X7)
| less(X6,X7)
| X6 = X7 )
& ( ( ~ less(X6,X7)
& X6 != X7 )
| less_or_equal(X6,X7) ) ),
inference(variable_rename,[status(thm)],[148]) ).
fof(150,plain,
! [X6,X7] :
( ( ~ less_or_equal(X6,X7)
| less(X6,X7)
| X6 = X7 )
& ( ~ less(X6,X7)
| less_or_equal(X6,X7) )
& ( X6 != X7
| less_or_equal(X6,X7) ) ),
inference(distribute,[status(thm)],[149]) ).
cnf(151,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[150]) ).
fof(182,plain,
! [X4] :
( ( ~ less(X4,n1)
| less_or_equal(X4,n0) )
& ( ~ less_or_equal(X4,n0)
| less(X4,n1) ) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(183,plain,
! [X5] :
( ( ~ less(X5,n1)
| less_or_equal(X5,n0) )
& ( ~ less_or_equal(X5,n0)
| less(X5,n1) ) ),
inference(variable_rename,[status(thm)],[182]) ).
cnf(184,plain,
( less(X1,n1)
| ~ less_or_equal(X1,n0) ),
inference(split_conjunct,[status(thm)],[183]) ).
fof(186,plain,
! [X4] :
( ( ~ less(X4,n2)
| less_or_equal(X4,n1) )
& ( ~ less_or_equal(X4,n1)
| less(X4,n2) ) ),
inference(fof_nnf,[status(thm)],[40]) ).
fof(187,plain,
! [X5] :
( ( ~ less(X5,n2)
| less_or_equal(X5,n1) )
& ( ~ less_or_equal(X5,n1)
| less(X5,n2) ) ),
inference(variable_rename,[status(thm)],[186]) ).
cnf(188,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
inference(split_conjunct,[status(thm)],[187]) ).
fof(194,plain,
! [X1,X3,X2] :
( ( ~ epred1_3(X2,X3,X1)
| ( X1 = push
& X3 = forwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = backwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = spinning
& happens(push,X2) ) )
& ( ( ( X1 != push
| X3 != forwards
| happens(pull,X2) )
& ( X1 != pull
| X3 != backwards
| happens(push,X2) )
& ( X1 != pull
| X3 != spinning
| ~ happens(push,X2) ) )
| epred1_3(X2,X3,X1) ) ),
inference(fof_nnf,[status(thm)],[55]) ).
fof(195,plain,
! [X4,X5,X6] :
( ( ~ epred1_3(X6,X5,X4)
| ( X4 = push
& X5 = forwards
& ~ happens(pull,X6) )
| ( X4 = pull
& X5 = backwards
& ~ happens(push,X6) )
| ( X4 = pull
& X5 = spinning
& happens(push,X6) ) )
& ( ( ( X4 != push
| X5 != forwards
| happens(pull,X6) )
& ( X4 != pull
| X5 != backwards
| happens(push,X6) )
& ( X4 != pull
| X5 != spinning
| ~ happens(push,X6) ) )
| epred1_3(X6,X5,X4) ) ),
inference(variable_rename,[status(thm)],[194]) ).
fof(196,plain,
! [X4,X5,X6] :
( ( X4 = pull
| X4 = pull
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| X4 = pull
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| X4 = pull
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| X5 = backwards
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| X5 = backwards
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| X5 = backwards
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| ~ happens(push,X6)
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| ~ happens(push,X6)
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| ~ happens(push,X6)
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| X4 = pull
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| X4 = pull
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| X4 = pull
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| X5 = backwards
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| X5 = backwards
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| X5 = backwards
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| ~ happens(push,X6)
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| ~ happens(push,X6)
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| ~ happens(push,X6)
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| X4 = pull
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| X4 = pull
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| X4 = pull
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| X5 = backwards
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| X5 = backwards
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| X5 = backwards
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| ~ happens(push,X6)
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| ~ happens(push,X6)
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| ~ happens(push,X6)
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( X4 != push
| X5 != forwards
| happens(pull,X6)
| epred1_3(X6,X5,X4) )
& ( X4 != pull
| X5 != backwards
| happens(push,X6)
| epred1_3(X6,X5,X4) )
& ( X4 != pull
| X5 != spinning
| ~ happens(push,X6)
| epred1_3(X6,X5,X4) ) ),
inference(distribute,[status(thm)],[195]) ).
cnf(198,plain,
( epred1_3(X1,X2,X3)
| happens(push,X1)
| X2 != backwards
| X3 != pull ),
inference(split_conjunct,[status(thm)],[196]) ).
cnf(294,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[151,theory(equality)]) ).
cnf(295,plain,
~ less(X1,X1),
inference(er,[status(thm)],[143,theory(equality)]) ).
cnf(384,plain,
( holdsAt(X1,plus(X2,n1))
| ~ happens(X3,X2)
| ~ epred1_3(X2,X1,X3) ),
inference(spm,[status(thm)],[117,66,theory(equality)]) ).
cnf(541,plain,
less(n1,n2),
inference(spm,[status(thm)],[188,294,theory(equality)]) ).
cnf(542,plain,
less(n0,n1),
inference(spm,[status(thm)],[184,294,theory(equality)]) ).
cnf(866,plain,
( holdsAt(X1,plus(X2,n1))
| happens(push,X2)
| ~ happens(X3,X2)
| pull != X3
| backwards != X1 ),
inference(spm,[status(thm)],[384,198,theory(equality)]) ).
cnf(1496,plain,
( holdsAt(X1,plus(X2,n1))
| happens(push,X2)
| pull != X3
| backwards != X1
| n1 != X2 ),
inference(spm,[status(thm)],[866,97,theory(equality)]) ).
cnf(2887,plain,
( holdsAt(X1,plus(X2,n1))
| happens(push,X2)
| backwards != X1
| n1 != X2 ),
inference(er,[status(thm)],[1496,theory(equality)]) ).
cnf(4281,plain,
( holdsAt(X1,n2)
| happens(push,n1)
| backwards != X1 ),
inference(spm,[status(thm)],[2887,127,theory(equality)]) ).
cnf(4328,plain,
happens(push,n1),
inference(spm,[status(thm)],[147,4281,theory(equality)]) ).
cnf(4352,plain,
( n2 = n1
| n0 = n1
| pull = push ),
inference(spm,[status(thm)],[103,4328,theory(equality)]) ).
cnf(4370,plain,
( n2 = n1
| n0 = n1 ),
inference(sr,[status(thm)],[4352,74,theory(equality)]) ).
cnf(4380,plain,
( less(n1,n1)
| n2 = n1 ),
inference(spm,[status(thm)],[542,4370,theory(equality)]) ).
cnf(4418,plain,
n2 = n1,
inference(sr,[status(thm)],[4380,295,theory(equality)]) ).
cnf(4435,plain,
less(n1,n1),
inference(rw,[status(thm)],[541,4418,theory(equality)]) ).
cnf(4436,plain,
$false,
inference(sr,[status(thm)],[4435,295,theory(equality)]) ).
cnf(4437,plain,
$false,
4436,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR018+1.p
% --creating new selector for [CSR001+0.ax, CSR001+2.ax]
% -running prover on /tmp/tmpBE-3qO/sel_CSR018+1.p_1 with time limit 29
% -prover status Theorem
% Problem CSR018+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR018+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR018+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------