%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET042-3 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 10.0s
% Output : Assurance 10.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SET/SET042-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 4 15)
% (binary-unit 28 #f 4 15)
% (binary-double 11 #f 4 15)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 15)
% (binary-order 28 #f 4 15)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(171,40,1,342,0,1)
%
%
% START OF PROOF
% 172 [] equal(X,X).
% 173 [] -member(X,Y) | little_set(X).
% 186 [] -equal(X,ordered_pair(Y,Z)) | -little_set(Z) | -little_set(Y) | ordered_pair_predicate(X).
% 213 [] member(X,cross_product(Y,Z)) | -member(first(X),Y) | -member(second(X),Z) | -ordered_pair_predicate(X) | -little_set(X).
% 318 [] equal(first(ordered_pair(X,Y)),X) | -little_set(Y) | -little_set(X).
% 319 [] equal(second(ordered_pair(X,Y)),Y) | -little_set(Y) | -little_set(X).
% 323 [] little_set(ordered_pair(X,Y)).
% 340 [] member(a,set_a).
% 341 [] member(b,set_b).
% 342 [] -member(ordered_pair(a,b),cross_product(set_a,set_b)).
% 440 [hyper:173,340] little_set(a).
% 831 [hyper:173,341] little_set(b).
% 859 [hyper:186,831,172,440] ordered_pair_predicate(ordered_pair(a,b)).
% 935 [hyper:318,831,440] equal(first(ordered_pair(a,b)),a).
% 948 [hyper:319,831,440] equal(second(ordered_pair(a,b)),b).
% 347246 [hyper:213,859,341,340,demod:935,948,cut:323,cut:342] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 15
% clause depth limited to 4
% seconds given: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 74
% derived clauses: 553889
% kept clauses: 77004
% kept size sum: 0
% kept mid-nuclei: 42957
% kept new demods: 455
% forw unit-subs: 4253
% forw double-subs: 5096
% forw overdouble-subs: 20109
% backward subs: 0
% fast unit cutoff: 189
% full unit cutoff: 0
% dbl unit cutoff: 7
% real runtime : 15.10
% process. runtime: 15.6
% specific non-discr-tree subsumption statistics:
% tried: 835052
% length fails: 2840
% strength fails: 40281
% predlist fails: 313549
% aux str. fails: 17076
% by-lit fails: 22196
% full subs tried: 437310
% full subs fail: 417137
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SET/SET042-3+eq_r.in")
%
%------------------------------------------------------------------------------