TSTP Solution File: REL002+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : REL002+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:45 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 36 unt; 0 def)
% Number of atoms : 36 ( 33 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 5 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/tmp/tmpvCgQdM/sel_REL002+1.p_1',maddux2_join_associativity) ).
fof(2,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/tmp/tmpvCgQdM/sel_REL002+1.p_1',maddux1_join_commutativity) ).
fof(3,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/tmp/tmpvCgQdM/sel_REL002+1.p_1',def_top) ).
fof(4,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/tmp/tmpvCgQdM/sel_REL002+1.p_1',maddux3_a_kind_of_de_Morgan) ).
fof(5,conjecture,
! [X1] : join(X1,top) = top,
file('/tmp/tmpvCgQdM/sel_REL002+1.p_1',goals) ).
fof(6,negated_conjecture,
~ ! [X1] : join(X1,top) = top,
inference(assume_negation,[status(cth)],[5]) ).
fof(7,plain,
! [X4,X5,X6] : join(X4,join(X5,X6)) = join(join(X4,X5),X6),
inference(variable_rename,[status(thm)],[1]) ).
cnf(8,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[7]) ).
fof(9,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[2]) ).
cnf(10,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[9]) ).
fof(11,plain,
! [X2] : top = join(X2,complement(X2)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(12,plain,
top = join(X1,complement(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] : join(X1,top) != top,
inference(fof_nnf,[status(thm)],[6]) ).
fof(16,negated_conjecture,
? [X2] : join(X2,top) != top,
inference(variable_rename,[status(thm)],[15]) ).
fof(17,negated_conjecture,
join(esk1_0,top) != top,
inference(skolemize,[status(esa)],[16]) ).
cnf(18,negated_conjecture,
join(esk1_0,top) != top,
inference(split_conjunct,[status(thm)],[17]) ).
cnf(19,negated_conjecture,
join(top,esk1_0) != top,
inference(rw,[status(thm)],[18,10,theory(equality)]) ).
cnf(20,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[12,8,theory(equality)]) ).
cnf(21,plain,
join(top,X2) = join(X1,join(complement(X1),X2)),
inference(spm,[status(thm)],[8,12,theory(equality)]) ).
cnf(31,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[14,10,theory(equality)]) ).
cnf(33,plain,
join(complement(join(complement(X1),complement(X1))),complement(top)) = X1,
inference(spm,[status(thm)],[31,12,theory(equality)]) ).
cnf(41,plain,
join(complement(top),complement(join(complement(X1),complement(X1)))) = X1,
inference(rw,[status(thm)],[33,10,theory(equality)]) ).
cnf(43,plain,
join(X1,top) = join(top,complement(complement(X1))),
inference(spm,[status(thm)],[21,12,theory(equality)]) ).
cnf(49,plain,
join(X1,join(X2,complement(X1))) = join(top,X2),
inference(spm,[status(thm)],[21,10,theory(equality)]) ).
cnf(86,plain,
join(X1,join(X2,complement(join(X2,X1)))) = top,
inference(spm,[status(thm)],[20,10,theory(equality)]) ).
cnf(257,plain,
join(join(complement(X1),complement(X1)),X1) = join(top,complement(top)),
inference(spm,[status(thm)],[49,41,theory(equality)]) ).
cnf(267,plain,
join(top,complement(X1)) = join(top,complement(top)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[257,8,theory(equality)]),10,theory(equality)]),12,theory(equality)]),10,theory(equality)]) ).
cnf(268,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[267,12,theory(equality)]) ).
cnf(284,plain,
top = join(X1,top),
inference(rw,[status(thm)],[43,268,theory(equality)]) ).
cnf(293,plain,
join(top,join(X1,complement(top))) = top,
inference(spm,[status(thm)],[86,284,theory(equality)]) ).
cnf(302,plain,
join(top,X1) = top,
inference(rw,[status(thm)],[293,49,theory(equality)]) ).
cnf(323,negated_conjecture,
$false,
inference(rw,[status(thm)],[19,302,theory(equality)]) ).
cnf(324,negated_conjecture,
$false,
inference(cn,[status(thm)],[323,theory(equality)]) ).
cnf(325,negated_conjecture,
$false,
324,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/REL/REL002+1.p
% --creating new selector for [REL001+0.ax]
% -running prover on /tmp/tmpvCgQdM/sel_REL002+1.p_1 with time limit 29
% -prover status Theorem
% Problem REL002+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/REL/REL002+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/REL/REL002+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
%
%------------------------------------------------------------------------------