TSTP Solution File: REL003+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : REL003+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:56 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 60 ( 55 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 50 ( 18 ~; 17 |; 11 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 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 : 23 ( 0 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/tmp/tmpqod12U/sel_REL003+1.p_1',converse_idempotence) ).
fof(4,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/tmp/tmpqod12U/sel_REL003+1.p_1',converse_additivity) ).
fof(5,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/tmp/tmpqod12U/sel_REL003+1.p_1',maddux1_join_commutativity) ).
fof(10,conjecture,
! [X1,X2] :
( ( join(X1,X2) = X2
=> join(converse(X1),converse(X2)) = converse(X2) )
& ( join(converse(X1),converse(X2)) = converse(X2)
=> join(X1,X2) = X2 ) ),
file('/tmp/tmpqod12U/sel_REL003+1.p_1',goals) ).
fof(11,negated_conjecture,
~ ! [X1,X2] :
( ( join(X1,X2) = X2
=> join(converse(X1),converse(X2)) = converse(X2) )
& ( join(converse(X1),converse(X2)) = converse(X2)
=> join(X1,X2) = X2 ) ),
inference(assume_negation,[status(cth)],[10]) ).
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(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(20,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[5]) ).
cnf(21,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[20]) ).
fof(30,negated_conjecture,
? [X1,X2] :
( ( join(X1,X2) = X2
& join(converse(X1),converse(X2)) != converse(X2) )
| ( join(converse(X1),converse(X2)) = converse(X2)
& join(X1,X2) != X2 ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(31,negated_conjecture,
? [X3,X4] :
( ( join(X3,X4) = X4
& join(converse(X3),converse(X4)) != converse(X4) )
| ( join(converse(X3),converse(X4)) = converse(X4)
& join(X3,X4) != X4 ) ),
inference(variable_rename,[status(thm)],[30]) ).
fof(32,negated_conjecture,
( ( join(esk1_0,esk2_0) = esk2_0
& join(converse(esk1_0),converse(esk2_0)) != converse(esk2_0) )
| ( join(converse(esk1_0),converse(esk2_0)) = converse(esk2_0)
& join(esk1_0,esk2_0) != esk2_0 ) ),
inference(skolemize,[status(esa)],[31]) ).
fof(33,negated_conjecture,
( ( join(converse(esk1_0),converse(esk2_0)) = converse(esk2_0)
| join(esk1_0,esk2_0) = esk2_0 )
& ( join(esk1_0,esk2_0) != esk2_0
| join(esk1_0,esk2_0) = esk2_0 )
& ( join(converse(esk1_0),converse(esk2_0)) = converse(esk2_0)
| join(converse(esk1_0),converse(esk2_0)) != converse(esk2_0) )
& ( join(esk1_0,esk2_0) != esk2_0
| join(converse(esk1_0),converse(esk2_0)) != converse(esk2_0) ) ),
inference(distribute,[status(thm)],[32]) ).
cnf(34,negated_conjecture,
( join(converse(esk1_0),converse(esk2_0)) != converse(esk2_0)
| join(esk1_0,esk2_0) != esk2_0 ),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(37,negated_conjecture,
( join(esk1_0,esk2_0) = esk2_0
| join(converse(esk1_0),converse(esk2_0)) = converse(esk2_0) ),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(54,negated_conjecture,
( join(esk2_0,esk1_0) = esk2_0
| join(converse(esk1_0),converse(esk2_0)) = converse(esk2_0) ),
inference(rw,[status(thm)],[37,21,theory(equality)]) ).
cnf(55,negated_conjecture,
( join(esk2_0,esk1_0) = esk2_0
| converse(join(esk2_0,esk1_0)) = converse(esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[54,19,theory(equality)]),21,theory(equality)]) ).
cnf(56,negated_conjecture,
( converse(converse(esk2_0)) = join(esk2_0,esk1_0)
| join(esk2_0,esk1_0) = esk2_0 ),
inference(spm,[status(thm)],[15,55,theory(equality)]) ).
cnf(59,negated_conjecture,
( esk2_0 = join(esk2_0,esk1_0)
| join(esk2_0,esk1_0) = esk2_0 ),
inference(rw,[status(thm)],[56,15,theory(equality)]) ).
cnf(60,negated_conjecture,
esk2_0 = join(esk2_0,esk1_0),
inference(cn,[status(thm)],[59,theory(equality)]) ).
cnf(74,negated_conjecture,
( join(esk2_0,esk1_0) != esk2_0
| join(converse(esk1_0),converse(esk2_0)) != converse(esk2_0) ),
inference(rw,[status(thm)],[34,21,theory(equality)]) ).
cnf(75,negated_conjecture,
( join(esk2_0,esk1_0) != esk2_0
| converse(join(esk2_0,esk1_0)) != converse(esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[74,19,theory(equality)]),21,theory(equality)]) ).
cnf(104,negated_conjecture,
( $false
| join(esk2_0,esk1_0) != esk2_0 ),
inference(rw,[status(thm)],[75,60,theory(equality)]) ).
cnf(105,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[104,60,theory(equality)]) ).
cnf(106,negated_conjecture,
$false,
inference(cn,[status(thm)],[105,theory(equality)]) ).
cnf(107,negated_conjecture,
$false,
106,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/REL/REL003+1.p
% --creating new selector for [REL001+0.ax]
% -running prover on /tmp/tmpqod12U/sel_REL003+1.p_1 with time limit 29
% -prover status Theorem
% Problem REL003+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/REL/REL003+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/REL/REL003+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
%
%------------------------------------------------------------------------------