TSTP Solution File: ANA020-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA020-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 39.8s
% Output : Assurance 39.8s
% 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/SystemOnTPTP16820/ANA/ANA020-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 58 #f 4 7)
% (binary-posweight-order 29 #f 4 7)
% (binary-unit 29 #f 4 7)
% (binary-double 29 #f 4 7)
% (binary 29 #t 4 7)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(13,40,0,26,0,0,2981,50,136,2994,0,136,1519345,4,4337)
%
%
% START OF PROOF
% 2983 [] equal(c_^h^o^l_^oabs(c_0,X),c_0) | -class_^ordered^group_^olordered__ab__group__abs(X).
% 2984 [] c_lessequals(c_0,c_^h^o^l_^oabs(X,Y),Y) | -class_^ordered^group_^olordered__ab__group__abs(Y).
% 2985 [] -c_less(X,Y,Z) | c_lessequals(X,Y,Z) | -class_^orderings_^oorder(Z).
% 2986 [] c_lessequals(c_0,c_times(X,Y,Z),Z) | -c_lessequals(c_0,X,Z) | -c_lessequals(c_0,Y,Z) | -class_^ring__and__^field_^opordered__cancel__semiring(Z).
% 2987 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ring__and__^field_^opordered__cancel__semiring(X).
% 2988 [] -class_^ring__and__^field_^oordered__idom(X) | class_^orderings_^oorder(X).
% 2989 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^olordered__ab__group__abs(X).
% 2990 [] equal(v_f(c_0),c_0).
% 2991 [] c_less(c_0,v_c,t_a).
% 2992 [] equal(v_x,c_0).
% 2993 [] -c_lessequals(c_^h^o^l_^oabs(v_f(v_x),t_a),c_times(v_c,c_^h^o^l_^oabs(v_h(v_x),t_a),t_a),t_a).
% 2994 [] class_^ring__and__^field_^oordered__idom(t_a).
% 2995 [hyper:2987,2994] class_^ring__and__^field_^opordered__cancel__semiring(t_a).
% 2996 [hyper:2988,2994] class_^orderings_^oorder(t_a).
% 2997 [hyper:2989,2994] class_^ordered^group_^olordered__ab__group__abs(t_a).
% 3000 [hyper:2983,2997] equal(c_^h^o^l_^oabs(c_0,t_a),c_0).
% 3001 [hyper:2984,2997] c_lessequals(c_0,c_^h^o^l_^oabs(X,t_a),t_a).
% 3005 [hyper:2985,2991,cut:2996] c_lessequals(c_0,v_c,t_a).
% 3013 [hyper:2986,3001,3005,cut:2995] c_lessequals(c_0,c_times(v_c,c_^h^o^l_^oabs(X,t_a),t_a),t_a).
% 1519347 [para:2992.1.1,2993.1.1.1.1,demod:3000,2990,cut:3013] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 5
% seconds given: 58
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4380
% derived clauses: 2309291
% kept clauses: 79032
% kept size sum: 0
% kept mid-nuclei: 3830
% kept new demods: 6
% forw unit-subs: 82995
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 3776
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 43.82
% process. runtime: 43.62
% specific non-discr-tree subsumption statistics:
% tried: 4
% length fails: 0
% strength fails: 4
% 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/SystemOnTPTP16820/ANA/ANA020-2+eq_r.in")
% WARNING: TreeLimitedRun lost 39.82s, total lost is 39.82s
%
%------------------------------------------------------------------------------