TSTP Solution File: COM011-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COM011-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 : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2795MHz
% 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/SystemOnTPTP15153/COM/COM011-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 4 5)
% (binary-unit 10 #f 4 5)
% (binary-double 16 #f)
% (binary 16 #t 4 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 4 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(10,40,0,20,0,0)
%
%
% START OF PROOF
% 11 [] -c_in(X,c_minus(Y,Z,tc_set(U)),U) | c_in(X,Y,U).
% 12 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 13 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 14 [] -c_in(X,c_^u^n^i^t^y_^oconstrains(Y,Z,U),tc_^u^n^i^t^y_^oprogram(U)) | c_in(X,c_^u^n^i^t^y_^oconstrains(V,Z,U),tc_^u^n^i^t^y_^oprogram(U)) | -c_lessequals(V,Y,tc_set(U)).
% 15 [] -c_in(X,c_^u^n^i^t^y_^oconstrains(c_minus(Y,Z,tc_set(U)),c_union(Y,Z,U),U),tc_^u^n^i^t^y_^oprogram(U)) | -c_in(X,c_^w^fair_^otransient(c_minus(Y,Z,tc_set(U)),U),tc_^u^n^i^t^y_^oprogram(U)) | c_in(X,c_^w^fair_^oensures(Y,Z,U),tc_^u^n^i^t^y_^oprogram(U)).
% 16 [] -c_in(X,c_^w^fair_^oensures(Y,Z,U),tc_^u^n^i^t^y_^oprogram(U)) | c_in(X,c_^w^fair_^oleads^to(Y,Z,U),tc_^u^n^i^t^y_^oprogram(U)).
% 17 [] -c_in(X,c_^w^fair_^otransient(Y,Z),tc_^u^n^i^t^y_^oprogram(Z)) | c_in(X,c_^w^fair_^otransient(U,Z),tc_^u^n^i^t^y_^oprogram(Z)) | -c_lessequals(U,Y,tc_set(Z)).
% 18 [] c_in(v_^f,c_^u^n^i^t^y_^oconstrains(v_^a,c_union(v_^a,v_^b,t_a),t_a),tc_^u^n^i^t^y_^oprogram(t_a)).
% 19 [] c_in(v_^f,c_^w^fair_^otransient(v_^a,t_a),tc_^u^n^i^t^y_^oprogram(t_a)).
% 20 [] -c_in(v_^f,c_^w^fair_^oleads^to(v_^a,v_^b,t_a),tc_^u^n^i^t^y_^oprogram(t_a)).
% 25 [hyper:11,12] c_in(c_^main_^osubset^i__1(c_minus(X,Y,tc_set(Z)),U,Z),X,Z) | c_lessequals(c_minus(X,Y,tc_set(Z)),U,tc_set(Z)).
% 60 [hyper:13,25] c_lessequals(c_minus(X,Y,tc_set(Z)),X,tc_set(Z)).
% 70 [hyper:14,60,18] c_in(v_^f,c_^u^n^i^t^y_^oconstrains(c_minus(v_^a,X,tc_set(t_a)),c_union(v_^a,v_^b,t_a),t_a),tc_^u^n^i^t^y_^oprogram(t_a)).
% 74 [hyper:17,60,19] c_in(v_^f,c_^w^fair_^otransient(c_minus(v_^a,X,tc_set(t_a)),t_a),tc_^u^n^i^t^y_^oprogram(t_a)).
% 87 [hyper:15,70,cut:74] c_in(v_^f,c_^w^fair_^oensures(v_^a,v_^b,t_a),tc_^u^n^i^t^y_^oprogram(t_a)).
% 89 [hyper:16,87,cut:20] 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 5
% clause depth limited to 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 17
% derived clauses: 153
% kept clauses: 28
% kept size sum: 626
% kept mid-nuclei: 30
% kept new demods: 0
% forw unit-subs: 16
% forw double-subs: 27
% forw overdouble-subs: 14
% backward subs: 0
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime : 0.2
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 34
% length fails: 4
% strength fails: 0
% predlist fails: 8
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 22
% full subs fail: 8
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP15153/COM/COM011-2+noeq.in")
%
%------------------------------------------------------------------------------