TSTP Solution File: REL001+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : REL001+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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 : Sun Dec 26 00:58:23 EST 2010
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 44 unt; 0 def)
% Number of atoms : 44 ( 41 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 22 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/tmp/tmpAN9zbB/sel_REL001+1.p_1',maddux4_definiton_of_meet) ).
fof(2,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/tmp/tmpAN9zbB/sel_REL001+1.p_1',maddux2_join_associativity) ).
fof(3,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/tmp/tmpAN9zbB/sel_REL001+1.p_1',maddux1_join_commutativity) ).
fof(4,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/tmp/tmpAN9zbB/sel_REL001+1.p_1',def_zero) ).
fof(5,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/tmp/tmpAN9zbB/sel_REL001+1.p_1',maddux3_a_kind_of_de_Morgan) ).
fof(6,conjecture,
! [X1] : join(zero,X1) = X1,
file('/tmp/tmpAN9zbB/sel_REL001+1.p_1',goals) ).
fof(7,negated_conjecture,
~ ! [X1] : join(zero,X1) = X1,
inference(assume_negation,[status(cth)],[6]) ).
fof(8,plain,
! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
inference(variable_rename,[status(thm)],[1]) ).
cnf(9,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[8]) ).
fof(10,plain,
! [X4,X5,X6] : join(X4,join(X5,X6)) = join(join(X4,X5),X6),
inference(variable_rename,[status(thm)],[2]) ).
cnf(11,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[10]) ).
fof(12,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[3]) ).
cnf(13,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[12]) ).
fof(14,plain,
! [X2] : zero = meet(X2,complement(X2)),
inference(variable_rename,[status(thm)],[4]) ).
cnf(15,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[14]) ).
fof(16,plain,
! [X3,X4] : X3 = join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),
inference(variable_rename,[status(thm)],[5]) ).
cnf(17,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[16]) ).
fof(18,negated_conjecture,
? [X1] : join(zero,X1) != X1,
inference(fof_nnf,[status(thm)],[7]) ).
fof(19,negated_conjecture,
? [X2] : join(zero,X2) != X2,
inference(variable_rename,[status(thm)],[18]) ).
fof(20,negated_conjecture,
join(zero,esk1_0) != esk1_0,
inference(skolemize,[status(esa)],[19]) ).
cnf(21,negated_conjecture,
join(zero,esk1_0) != esk1_0,
inference(split_conjunct,[status(thm)],[20]) ).
cnf(22,plain,
complement(join(complement(X1),complement(complement(X1)))) = zero,
inference(rw,[status(thm)],[15,9,theory(equality)]),
[unfolding] ).
cnf(23,plain,
complement(join(zero,complement(zero))) = zero,
inference(spm,[status(thm)],[22,22,theory(equality)]) ).
cnf(25,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[13,11,theory(equality)]) ).
cnf(27,plain,
join(join(X2,X1),X3) = join(X1,join(X2,X3)),
inference(spm,[status(thm)],[11,13,theory(equality)]) ).
cnf(31,plain,
join(X2,join(X1,X3)) = join(X1,join(X2,X3)),
inference(rw,[status(thm)],[27,11,theory(equality)]) ).
cnf(33,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[17,13,theory(equality)]) ).
cnf(37,plain,
join(complement(join(complement(X1),complement(X1))),zero) = X1,
inference(spm,[status(thm)],[33,22,theory(equality)]) ).
cnf(41,plain,
join(complement(join(X2,complement(X1))),complement(join(complement(X1),complement(X2)))) = X1,
inference(spm,[status(thm)],[33,13,theory(equality)]) ).
cnf(46,plain,
join(zero,complement(join(complement(X1),complement(X1)))) = X1,
inference(rw,[status(thm)],[37,13,theory(equality)]) ).
cnf(54,plain,
join(X1,X2) = join(zero,join(complement(join(complement(X1),complement(X1))),X2)),
inference(spm,[status(thm)],[11,46,theory(equality)]) ).
cnf(55,plain,
join(zero,complement(join(zero,zero))) = join(zero,complement(zero)),
inference(spm,[status(thm)],[46,23,theory(equality)]) ).
cnf(123,plain,
join(X1,join(zero,complement(zero))) = join(zero,join(X1,complement(join(zero,zero)))),
inference(spm,[status(thm)],[31,55,theory(equality)]) ).
cnf(945,plain,
join(complement(join(zero,complement(zero))),complement(join(complement(join(zero,zero)),complement(zero)))) = join(zero,zero),
inference(spm,[status(thm)],[41,55,theory(equality)]) ).
cnf(990,plain,
join(zero,complement(join(complement(zero),complement(join(zero,zero))))) = join(zero,zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[945,23,theory(equality)]),13,theory(equality)]) ).
cnf(1229,plain,
join(X1,complement(join(zero,zero))) = join(complement(join(complement(X1),complement(X1))),join(zero,complement(zero))),
inference(spm,[status(thm)],[123,54,theory(equality)]) ).
cnf(1261,plain,
join(X1,complement(join(zero,zero))) = join(complement(zero),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1229,25,theory(equality)]),13,theory(equality)]),46,theory(equality)]) ).
cnf(1395,plain,
join(zero,complement(join(complement(zero),complement(zero)))) = join(zero,zero),
inference(rw,[status(thm)],[990,1261,theory(equality)]) ).
cnf(1396,plain,
zero = join(zero,zero),
inference(rw,[status(thm)],[1395,46,theory(equality)]) ).
cnf(1423,plain,
join(zero,X1) = join(zero,join(zero,X1)),
inference(spm,[status(thm)],[11,1396,theory(equality)]) ).
cnf(1454,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[1423,46,theory(equality)]) ).
cnf(1540,negated_conjecture,
$false,
inference(rw,[status(thm)],[21,1454,theory(equality)]) ).
cnf(1541,negated_conjecture,
$false,
inference(cn,[status(thm)],[1540,theory(equality)]) ).
cnf(1542,negated_conjecture,
$false,
1541,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/REL/REL001+1.p
% --creating new selector for [REL001+0.ax]
% -running prover on /tmp/tmpAN9zbB/sel_REL001+1.p_1 with time limit 29
% -prover status Theorem
% Problem REL001+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/REL/REL001+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/REL/REL001+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
%
%------------------------------------------------------------------------------