↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : ANA012-2 : TPTP v3.4.2. Released v3.2.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art03.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s

% Result   : Unsatisfiable 0.0s
% Output   : Assurance 0.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: /tmp/SystemOnTPTP16666/ANA/ANA012-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: small
% 
% strategies selected: 
% (hyper 27 #f 3 5)
% (binary-unit 10 #f 3 5)
% (binary-double 10 #f 3 5)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 3 5)
% (binary-order 27 #f 3 5)
% (binary-posweight-order 125 #f)
% (binary-posweight-lex-big-order 43 #f)
% (binary-posweight-lex-small-order 16 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-weightorder 65 #f)
% (binary-order 27 #f)
% (hyper-order 37 #f)
% (binary 63 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(10,40,0,20,0,0,34,50,0,44,0,0,63,50,0,73,0,0,97,50,0,107,0,0,136,50,0,146,0,0,180,50,0,190,0,0,229,50,0,239,0,0,283,50,0,293,0,0,342,50,1,352,0,1,406,50,1,416,0,1,475,50,1,485,0,1,549,50,2,559,0,2,628,50,2,638,0,2,712,50,3,722,0,3,801,50,3,811,0,3,895,50,4,905,0,4,994,50,5,1004,0,5,1098,50,6,1108,0,6,1207,50,7,1217,0,7,1321,50,9,1321,40,9,1331,0,9)
% 
% 
% START OF PROOF
% 1323 [] -equal(c_^h^o^l_^oabs(X,Y),c_0) | equal(X,c_0) | -class_^ordered^group_^olordered__ab__group__abs(Y).
% 1324 [] c_lessequals(X,X,Y) | -class_^orderings_^oorder(Y).
% 1325 [] equal(c_times(c_^h^o^l_^oinverse(X,Y),X,Y),c_1) | equal(X,c_0) | -class_^ring__and__^field_^ofield(Y).
% 1326 [] -class_^ring__and__^field_^oordered__field(X) | class_^ring__and__^field_^ofield(X).
% 1327 [] -class_^ring__and__^field_^oordered__field(X) | class_^ordered^group_^olordered__ab__group__abs(X).
% 1328 [] -class_^ring__and__^field_^oordered__field(X) | class_^orderings_^oorder(X).
% 1329 [] -equal(v_c,c_0).
% 1330 [] -c_lessequals(c_1,c_times(X,c_^h^o^l_^oabs(v_c,t_a),t_a),t_a).
% 1331 [] class_^ring__and__^field_^oordered__field(t_a).
% 1333 [binary:1331,1326] class_^ring__and__^field_^ofield(t_a).
% 1335 [binary:1331,1327] class_^ordered^group_^olordered__ab__group__abs(t_a).
% 1337 [binary:1331,1328] class_^orderings_^oorder(t_a).
% 1339 [binary:1337,1324.2] c_lessequals(X,X,t_a).
% 1342 [binary:1329,1323.2] -equal(c_^h^o^l_^oabs(v_c,X),c_0) | -class_^ordered^group_^olordered__ab__group__abs(X).
% 1345 [binary:1335,1342.2] -equal(c_^h^o^l_^oabs(v_c,t_a),c_0).
% 1358 [para:1325.1.1,1330.1.2,cut:1339,cut:1345,cut:1333] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 5
% clause depth limited to 3
% seconds given: 10
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    664
%  derived clauses:   2025
%  kept clauses:      474
%  kept size sum:     13121
%  kept mid-nuclei:   361
%  kept new demods:   190
%  forw unit-subs:    647
%  forw double-subs: 190
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.10
%  process. runtime:  0.9
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 0
%  full subs fail:  0
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP16666/ANA/ANA012-2+eq_r.in")
% Killed 1 orphans
% 
%------------------------------------------------------------------------------