TSTP Solution File: REL046+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : REL046+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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 01:41:01 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 24 unt; 0 def)
% Number of atoms : 47 ( 44 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 15 ~; 7 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 24 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/tmp/tmpGczj6T/sel_REL046+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/tmpGczj6T/sel_REL046+1.p_1',maddux2_join_associativity) ).
fof(3,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/tmp/tmpGczj6T/sel_REL046+1.p_1',maddux1_join_commutativity) ).
fof(4,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/tmp/tmpGczj6T/sel_REL046+1.p_1',maddux3_a_kind_of_de_Morgan) ).
fof(5,conjecture,
! [X1,X2,X3] :
( join(X1,meet(X2,X3)) = meet(X2,X3)
=> ( join(X1,X2) = X2
& join(X1,X3) = X3 ) ),
file('/tmp/tmpGczj6T/sel_REL046+1.p_1',goals) ).
fof(6,negated_conjecture,
~ ! [X1,X2,X3] :
( join(X1,meet(X2,X3)) = meet(X2,X3)
=> ( join(X1,X2) = X2
& join(X1,X3) = X3 ) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(7,plain,
! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
inference(variable_rename,[status(thm)],[1]) ).
cnf(8,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[7]) ).
fof(9,plain,
! [X4,X5,X6] : join(X4,join(X5,X6)) = join(join(X4,X5),X6),
inference(variable_rename,[status(thm)],[2]) ).
cnf(10,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[9]) ).
fof(11,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[3]) ).
cnf(12,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[11]) ).
fof(13,plain,
! [X3,X4] : X3 = join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),
inference(variable_rename,[status(thm)],[4]) ).
cnf(14,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[13]) ).
fof(15,negated_conjecture,
? [X1,X2,X3] :
( join(X1,meet(X2,X3)) = meet(X2,X3)
& ( join(X1,X2) != X2
| join(X1,X3) != X3 ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(16,negated_conjecture,
? [X4,X5,X6] :
( join(X4,meet(X5,X6)) = meet(X5,X6)
& ( join(X4,X5) != X5
| join(X4,X6) != X6 ) ),
inference(variable_rename,[status(thm)],[15]) ).
fof(17,negated_conjecture,
( join(esk1_0,meet(esk2_0,esk3_0)) = meet(esk2_0,esk3_0)
& ( join(esk1_0,esk2_0) != esk2_0
| join(esk1_0,esk3_0) != esk3_0 ) ),
inference(skolemize,[status(esa)],[16]) ).
cnf(18,negated_conjecture,
( join(esk1_0,esk3_0) != esk3_0
| join(esk1_0,esk2_0) != esk2_0 ),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(19,negated_conjecture,
join(esk1_0,meet(esk2_0,esk3_0)) = meet(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(20,negated_conjecture,
join(esk1_0,complement(join(complement(esk2_0),complement(esk3_0)))) = complement(join(complement(esk2_0),complement(esk3_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[19,8,theory(equality)]),8,theory(equality)]),
[unfolding] ).
cnf(21,negated_conjecture,
( join(esk2_0,esk1_0) != esk2_0
| join(esk1_0,esk3_0) != esk3_0 ),
inference(rw,[status(thm)],[18,12,theory(equality)]) ).
cnf(22,negated_conjecture,
( join(esk2_0,esk1_0) != esk2_0
| join(esk3_0,esk1_0) != esk3_0 ),
inference(rw,[status(thm)],[21,12,theory(equality)]) ).
cnf(23,negated_conjecture,
join(complement(join(complement(esk2_0),complement(esk3_0))),X1) = join(esk1_0,join(complement(join(complement(esk2_0),complement(esk3_0))),X1)),
inference(spm,[status(thm)],[10,20,theory(equality)]) ).
cnf(33,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[14,12,theory(equality)]) ).
cnf(37,plain,
join(complement(join(X2,complement(X1))),complement(join(complement(X1),complement(X2)))) = X1,
inference(spm,[status(thm)],[33,12,theory(equality)]) ).
cnf(43,negated_conjecture,
join(esk1_0,esk2_0) = esk2_0,
inference(spm,[status(thm)],[23,33,theory(equality)]) ).
cnf(48,negated_conjecture,
join(esk2_0,esk1_0) = esk2_0,
inference(rw,[status(thm)],[43,12,theory(equality)]) ).
cnf(50,negated_conjecture,
( $false
| join(esk3_0,esk1_0) != esk3_0 ),
inference(rw,[status(thm)],[22,48,theory(equality)]) ).
cnf(51,negated_conjecture,
join(esk3_0,esk1_0) != esk3_0,
inference(cn,[status(thm)],[50,theory(equality)]) ).
cnf(709,negated_conjecture,
join(esk1_0,esk3_0) = esk3_0,
inference(spm,[status(thm)],[23,37,theory(equality)]) ).
cnf(735,negated_conjecture,
join(esk3_0,esk1_0) = esk3_0,
inference(rw,[status(thm)],[709,12,theory(equality)]) ).
cnf(736,negated_conjecture,
$false,
inference(sr,[status(thm)],[735,51,theory(equality)]) ).
cnf(737,negated_conjecture,
$false,
736,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/REL/REL046+1.p
% --creating new selector for [REL001+0.ax]
% -running prover on /tmp/tmpGczj6T/sel_REL046+1.p_1 with time limit 29
% -prover status Theorem
% Problem REL046+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/REL/REL046+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/REL/REL046+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
%
%------------------------------------------------------------------------------