TSTP Solution File: REL023+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : REL023+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:15:32 EST 2010
% Result : Theorem 238.99s
% Output : CNFRefutation 238.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 7
% Syntax : Number of formulae : 67 ( 67 unt; 0 def)
% Number of atoms : 67 ( 64 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 92 ( 4 sgn 32 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/tmp/tmppZ1P6i/sel_REL023+1.p_5',composition_distributivity) ).
fof(4,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/tmp/tmppZ1P6i/sel_REL023+1.p_5',maddux1_join_commutativity) ).
fof(6,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/tmp/tmppZ1P6i/sel_REL023+1.p_5',def_zero) ).
fof(7,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/tmp/tmppZ1P6i/sel_REL023+1.p_5',maddux4_definiton_of_meet) ).
fof(10,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/tmp/tmppZ1P6i/sel_REL023+1.p_5',maddux2_join_associativity) ).
fof(11,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/tmp/tmppZ1P6i/sel_REL023+1.p_5',maddux3_a_kind_of_de_Morgan) ).
fof(12,conjecture,
! [X1,X2,X3] : join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3))) = composition(X1,meet(X2,X3)),
file('/tmp/tmppZ1P6i/sel_REL023+1.p_5',goals) ).
fof(13,negated_conjecture,
~ ! [X1,X2,X3] : join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3))) = composition(X1,meet(X2,X3)),
inference(assume_negation,[status(cth)],[12]) ).
fof(14,plain,
! [X4,X5,X6] : composition(join(X4,X5),X6) = join(composition(X4,X6),composition(X5,X6)),
inference(variable_rename,[status(thm)],[1]) ).
cnf(15,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[14]) ).
fof(20,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[4]) ).
cnf(21,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[20]) ).
fof(24,plain,
! [X2] : zero = meet(X2,complement(X2)),
inference(variable_rename,[status(thm)],[6]) ).
cnf(25,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[24]) ).
fof(26,plain,
! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
inference(variable_rename,[status(thm)],[7]) ).
cnf(27,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[26]) ).
fof(32,plain,
! [X4,X5,X6] : join(X4,join(X5,X6)) = join(join(X4,X5),X6),
inference(variable_rename,[status(thm)],[10]) ).
cnf(33,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[32]) ).
fof(34,plain,
! [X3,X4] : X3 = join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),
inference(variable_rename,[status(thm)],[11]) ).
cnf(35,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[34]) ).
fof(36,negated_conjecture,
? [X1,X2,X3] : join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3))) != composition(X1,meet(X2,X3)),
inference(fof_nnf,[status(thm)],[13]) ).
fof(37,negated_conjecture,
? [X4,X5,X6] : join(composition(meet(X4,converse(X5)),meet(X5,X6)),composition(X4,meet(X5,X6))) != composition(X4,meet(X5,X6)),
inference(variable_rename,[status(thm)],[36]) ).
fof(38,negated_conjecture,
join(composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0)),composition(esk1_0,meet(esk2_0,esk3_0))) != composition(esk1_0,meet(esk2_0,esk3_0)),
inference(skolemize,[status(esa)],[37]) ).
cnf(39,negated_conjecture,
join(composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0)),composition(esk1_0,meet(esk2_0,esk3_0))) != composition(esk1_0,meet(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[38]) ).
cnf(40,plain,
complement(join(complement(X1),complement(complement(X1)))) = zero,
inference(rw,[status(thm)],[25,27,theory(equality)]),
[unfolding] ).
cnf(41,negated_conjecture,
join(composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk2_0),complement(esk3_0)))),composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0))))) != composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[39,27,theory(equality)]),27,theory(equality)]),27,theory(equality)]),27,theory(equality)]),
[unfolding] ).
cnf(50,plain,
complement(join(zero,complement(zero))) = zero,
inference(spm,[status(thm)],[40,40,theory(equality)]) ).
cnf(55,plain,
join(join(X2,X1),X3) = join(X1,join(X2,X3)),
inference(spm,[status(thm)],[33,21,theory(equality)]) ).
cnf(59,plain,
join(X2,join(X1,X3)) = join(X1,join(X2,X3)),
inference(rw,[status(thm)],[55,33,theory(equality)]) ).
cnf(81,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[35,21,theory(equality)]) ).
cnf(85,plain,
join(complement(join(complement(X1),complement(X1))),zero) = X1,
inference(spm,[status(thm)],[81,40,theory(equality)]) ).
cnf(91,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X2),complement(X1)))) = X1,
inference(spm,[status(thm)],[81,21,theory(equality)]) ).
cnf(95,plain,
join(zero,complement(join(complement(X1),complement(X1)))) = X1,
inference(rw,[status(thm)],[85,21,theory(equality)]) ).
cnf(97,negated_conjecture,
composition(join(esk1_0,complement(join(complement(esk1_0),complement(converse(esk2_0))))),complement(join(complement(esk2_0),complement(esk3_0)))) != composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[41,15,theory(equality)]),21,theory(equality)]) ).
cnf(202,plain,
join(zero,complement(join(zero,zero))) = join(complement(X1),complement(complement(X1))),
inference(spm,[status(thm)],[95,40,theory(equality)]) ).
cnf(204,plain,
join(zero,complement(join(zero,zero))) = join(zero,complement(zero)),
inference(spm,[status(thm)],[95,50,theory(equality)]) ).
cnf(1182,plain,
join(zero,complement(zero)) = join(complement(X1),complement(complement(X1))),
inference(rw,[status(thm)],[202,204,theory(equality)]) ).
cnf(1184,plain,
join(complement(join(zero,complement(zero))),complement(join(complement(X1),complement(complement(complement(X1)))))) = X1,
inference(spm,[status(thm)],[81,1182,theory(equality)]) ).
cnf(1196,plain,
join(zero,complement(join(complement(X1),complement(complement(complement(X1)))))) = X1,
inference(rw,[status(thm)],[1184,50,theory(equality)]) ).
cnf(1229,plain,
join(zero,complement(join(zero,complement(complement(zero))))) = join(zero,complement(zero)),
inference(spm,[status(thm)],[1196,50,theory(equality)]) ).
cnf(2746,plain,
join(complement(join(complement(complement(X1)),X1)),complement(join(zero,complement(zero)))) = complement(X1),
inference(spm,[status(thm)],[91,1182,theory(equality)]) ).
cnf(2793,plain,
join(zero,complement(join(X1,complement(complement(X1))))) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2746,21,theory(equality)]),50,theory(equality)]),21,theory(equality)]) ).
cnf(2830,plain,
complement(zero) = join(zero,complement(zero)),
inference(rw,[status(thm)],[1229,2793,theory(equality)]) ).
cnf(2831,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[1196,2793,theory(equality)]) ).
cnf(2853,plain,
join(zero,complement(join(X1,X1))) = complement(X1),
inference(rw,[status(thm)],[2793,2831,theory(equality)]) ).
cnf(2857,plain,
join(complement(X1),X1) = join(zero,complement(zero)),
inference(rw,[status(thm)],[1182,2831,theory(equality)]) ).
cnf(2858,plain,
join(X1,complement(X1)) = join(zero,complement(zero)),
inference(rw,[status(thm)],[2857,21,theory(equality)]) ).
cnf(2874,plain,
complement(complement(zero)) = zero,
inference(rw,[status(thm)],[50,2830,theory(equality)]) ).
cnf(2931,plain,
join(X1,complement(X1)) = complement(zero),
inference(rw,[status(thm)],[2858,2830,theory(equality)]) ).
cnf(2957,plain,
join(X1,complement(zero)) = join(X2,join(X1,complement(X2))),
inference(spm,[status(thm)],[59,2931,theory(equality)]) ).
cnf(3312,plain,
join(join(X1,X1),complement(X1)) = join(zero,complement(zero)),
inference(spm,[status(thm)],[2957,2853,theory(equality)]) ).
cnf(3360,plain,
join(X1,complement(zero)) = join(zero,complement(zero)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[3312,33,theory(equality)]),2931,theory(equality)]) ).
cnf(3361,plain,
join(X1,complement(zero)) = complement(zero),
inference(rw,[status(thm)],[3360,2931,theory(equality)]) ).
cnf(3393,plain,
join(zero,complement(complement(zero))) = complement(complement(zero)),
inference(spm,[status(thm)],[2853,3361,theory(equality)]) ).
cnf(3425,plain,
join(zero,zero) = complement(complement(zero)),
inference(rw,[status(thm)],[3393,2874,theory(equality)]) ).
cnf(3426,plain,
join(zero,zero) = zero,
inference(rw,[status(thm)],[3425,2874,theory(equality)]) ).
cnf(3437,plain,
join(zero,X1) = join(zero,join(zero,X1)),
inference(spm,[status(thm)],[33,3426,theory(equality)]) ).
cnf(3940,plain,
join(zero,complement(X1)) = complement(X1),
inference(spm,[status(thm)],[3437,2853,theory(equality)]) ).
cnf(4005,plain,
complement(join(X1,X1)) = complement(X1),
inference(rw,[status(thm)],[2853,3940,theory(equality)]) ).
cnf(4018,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = join(X1,X1),
inference(spm,[status(thm)],[81,4005,theory(equality)]) ).
cnf(4054,plain,
X1 = join(X1,X1),
inference(rw,[status(thm)],[4018,81,theory(equality)]) ).
cnf(4197,plain,
join(X1,X2) = join(X1,join(X1,X2)),
inference(spm,[status(thm)],[33,4054,theory(equality)]) ).
cnf(5007,plain,
join(complement(join(complement(X1),X2)),X1) = X1,
inference(spm,[status(thm)],[4197,81,theory(equality)]) ).
cnf(5088,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[5007,21,theory(equality)]) ).
cnf(5622,negated_conjecture,
$false,
inference(rw,[status(thm)],[97,5088,theory(equality)]) ).
cnf(5623,negated_conjecture,
$false,
inference(cn,[status(thm)],[5622,theory(equality)]) ).
cnf(5624,negated_conjecture,
$false,
5623,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/REL/REL023+1.p
% --creating new selector for [REL001+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmppZ1P6i/sel_REL023+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmppZ1P6i/sel_REL023+1.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [REL001+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmppZ1P6i/sel_REL023+1.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [REL001+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmppZ1P6i/sel_REL023+1.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [REL001+0.ax]
% -running prover on /tmp/tmppZ1P6i/sel_REL023+1.p_5 with time limit 54
% -prover status Theorem
% Problem REL023+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/REL/REL023+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/REL/REL023+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
%
%------------------------------------------------------------------------------