TSTP Solution File: SEU306+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU306+2 : TPTP v5.0.0. Released v3.3.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 07:04:56 EST 2010
% Result : Theorem 0.71s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 24 ( 10 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 3 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(278,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/tmp/tmpExSDB3/sel_SEU306+2.p_1',d3_pre_topc) ).
fof(322,conjecture,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/tmp/tmpExSDB3/sel_SEU306+2.p_1',t12_pre_topc) ).
fof(475,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
inference(assume_negation,[status(cth)],[322]) ).
fof(2271,plain,
! [X1] :
( ~ one_sorted_str(X1)
| cast_as_carrier_subset(X1) = the_carrier(X1) ),
inference(fof_nnf,[status(thm)],[278]) ).
fof(2272,plain,
! [X2] :
( ~ one_sorted_str(X2)
| cast_as_carrier_subset(X2) = the_carrier(X2) ),
inference(variable_rename,[status(thm)],[2271]) ).
cnf(2273,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[2272]) ).
fof(2540,negated_conjecture,
? [X1] :
( one_sorted_str(X1)
& cast_as_carrier_subset(X1) != the_carrier(X1) ),
inference(fof_nnf,[status(thm)],[475]) ).
fof(2541,negated_conjecture,
? [X2] :
( one_sorted_str(X2)
& cast_as_carrier_subset(X2) != the_carrier(X2) ),
inference(variable_rename,[status(thm)],[2540]) ).
fof(2542,negated_conjecture,
( one_sorted_str(esk207_0)
& cast_as_carrier_subset(esk207_0) != the_carrier(esk207_0) ),
inference(skolemize,[status(esa)],[2541]) ).
cnf(2543,negated_conjecture,
cast_as_carrier_subset(esk207_0) != the_carrier(esk207_0),
inference(split_conjunct,[status(thm)],[2542]) ).
cnf(2544,negated_conjecture,
one_sorted_str(esk207_0),
inference(split_conjunct,[status(thm)],[2542]) ).
cnf(4391,negated_conjecture,
~ one_sorted_str(esk207_0),
inference(spm,[status(thm)],[2543,2273,theory(equality)]) ).
cnf(4392,negated_conjecture,
$false,
inference(rw,[status(thm)],[4391,2544,theory(equality)]) ).
cnf(4393,negated_conjecture,
$false,
inference(cn,[status(thm)],[4392,theory(equality)]) ).
cnf(4394,negated_conjecture,
$false,
4393,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU306+2.p
% --creating new selector for []
% -running prover on /tmp/tmpExSDB3/sel_SEU306+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU306+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU306+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU306+2.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
%
%------------------------------------------------------------------------------