TSTP Solution File: REL008+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : REL008+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:01:05 EST 2010
% Result : Theorem 185.76s
% Output : CNFRefutation 185.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 27 unt; 0 def)
% Number of atoms : 27 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 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 : 53 ( 0 sgn 22 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/tmp/tmpD62WMe/sel_REL008+1.p_4',converse_multiplicativity) ).
fof(2,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/tmp/tmpD62WMe/sel_REL008+1.p_4',converse_idempotence) ).
fof(3,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/tmp/tmpD62WMe/sel_REL008+1.p_4',composition_distributivity) ).
fof(4,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/tmp/tmpD62WMe/sel_REL008+1.p_4',converse_additivity) ).
fof(10,conjecture,
! [X1,X2,X3] : composition(X1,join(X2,X3)) = join(composition(X1,X2),composition(X1,X3)),
file('/tmp/tmpD62WMe/sel_REL008+1.p_4',goals) ).
fof(11,negated_conjecture,
~ ! [X1,X2,X3] : composition(X1,join(X2,X3)) = join(composition(X1,X2),composition(X1,X3)),
inference(assume_negation,[status(cth)],[10]) ).
fof(12,plain,
! [X3,X4] : converse(composition(X3,X4)) = composition(converse(X4),converse(X3)),
inference(variable_rename,[status(thm)],[1]) ).
cnf(13,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[12]) ).
fof(14,plain,
! [X2] : converse(converse(X2)) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(15,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[14]) ).
fof(16,plain,
! [X4,X5,X6] : composition(join(X4,X5),X6) = join(composition(X4,X6),composition(X5,X6)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(17,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[16]) ).
fof(18,plain,
! [X3,X4] : converse(join(X3,X4)) = join(converse(X3),converse(X4)),
inference(variable_rename,[status(thm)],[4]) ).
cnf(19,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[18]) ).
fof(30,negated_conjecture,
? [X1,X2,X3] : composition(X1,join(X2,X3)) != join(composition(X1,X2),composition(X1,X3)),
inference(fof_nnf,[status(thm)],[11]) ).
fof(31,negated_conjecture,
? [X4,X5,X6] : composition(X4,join(X5,X6)) != join(composition(X4,X5),composition(X4,X6)),
inference(variable_rename,[status(thm)],[30]) ).
fof(32,negated_conjecture,
composition(esk1_0,join(esk2_0,esk3_0)) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),
inference(skolemize,[status(esa)],[31]) ).
cnf(33,negated_conjecture,
composition(esk1_0,join(esk2_0,esk3_0)) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(35,plain,
composition(converse(X1),X2) = converse(composition(converse(X2),X1)),
inference(spm,[status(thm)],[13,15,theory(equality)]) ).
cnf(57,plain,
join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
inference(spm,[status(thm)],[17,13,theory(equality)]) ).
cnf(104,plain,
join(composition(converse(X2),X1),converse(X3)) = converse(join(composition(converse(X1),X2),X3)),
inference(spm,[status(thm)],[19,35,theory(equality)]) ).
cnf(1169,plain,
converse(composition(join(converse(X1),converse(X3)),converse(X2))) = join(composition(converse(converse(X2)),X1),converse(converse(composition(X2,X3)))),
inference(spm,[status(thm)],[104,57,theory(equality)]) ).
cnf(1217,plain,
composition(X2,join(X1,X3)) = join(composition(converse(converse(X2)),X1),converse(converse(composition(X2,X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1169,19,theory(equality)]),13,theory(equality)]),15,theory(equality)]) ).
cnf(1218,plain,
composition(X2,join(X1,X3)) = join(composition(X2,X1),composition(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[1217,15,theory(equality)]),15,theory(equality)]) ).
cnf(1663,negated_conjecture,
$false,
inference(rw,[status(thm)],[33,1218,theory(equality)]) ).
cnf(1664,negated_conjecture,
$false,
inference(cn,[status(thm)],[1663,theory(equality)]) ).
cnf(1665,negated_conjecture,
$false,
1664,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/REL/REL008+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/tmpD62WMe/sel_REL008+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpD62WMe/sel_REL008+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [REL001+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpD62WMe/sel_REL008+1.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [REL001+0.ax]
% -running prover on /tmp/tmpD62WMe/sel_REL008+1.p_4 with time limit 56
% -prover status Theorem
% Problem REL008+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/REL/REL008+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/REL/REL008+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
%
%------------------------------------------------------------------------------