TSTP Solution File: COM011-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COM011-1 : 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 : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% Result : Unsatisfiable 84.8s
% Output : Assurance 84.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/SystemOnTPTP24624/COM/COM011-1+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 7)
% (binary-unit 28 #f 4 7)
% (binary-double 11 #f 4 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 7)
% (binary-order 28 #f 4 7)
% (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(1375,40,6,2750,0,12,277866,4,2132,294104,5,2813,294104,1,2813,294104,50,2819,294104,40,2819,295479,0,2820,330619,3,4221,332484,4,4921,346083,5,5621,346085,5,5622,346085,1,5622,346085,50,5626,346085,40,5626,347460,0,5627,367731,3,6178,373884,4,6453,387123,5,6728,387123,5,6728,387124,1,6728,387124,50,6730,387124,40,6730,388499,0,6731,427026,3,7582,445070,4,8007,455276,5,8432,455277,5,8433,455278,1,8433,455278,50,8438,455278,40,8438,456653,0,8439)
%
%
% START OF PROOF
% 455431 [] -c_in(X,c_uminus(Y,tc_set(Z)),Z) | -c_in(X,Y,Z).
% 455432 [] c_in(X,c_uminus(Y,tc_set(Z)),Z) | c_in(X,Y,Z).
% 455437 [] -c_in(X,c_minus(Y,Z,tc_set(U)),U) | c_in(X,Y,U).
% 455443 [] -c_in(X,c_^pow(Y,Z),tc_set(Z)) | c_lessequals(X,Y,tc_set(Z)).
% 455444 [] c_in(X,c_^pow(Y,Z),tc_set(Z)) | -c_lessequals(X,Y,tc_set(Z)).
% 455586 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 455587 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 456645 [] -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)).
% 456648 [] -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)).
% 456649 [] -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)).
% 456650 [] -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)).
% 456651 [] 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)).
% 456652 [] c_in(v_^f,c_^w^fair_^otransient(v_^a,t_a),tc_^u^n^i^t^y_^oprogram(t_a)).
% 456653 [] -c_in(v_^f,c_^w^fair_^oleads^to(v_^a,v_^b,t_a),tc_^u^n^i^t^y_^oprogram(t_a)).
% 456671 [binary:456650,456652] c_in(v_^f,c_^w^fair_^otransient(X,t_a),tc_^u^n^i^t^y_^oprogram(t_a)) | -c_lessequals(X,v_^a,tc_set(t_a)).
% 456684 [binary:456649.2,456653] -c_in(v_^f,c_^w^fair_^oensures(v_^a,v_^b,t_a),tc_^u^n^i^t^y_^oprogram(t_a)).
% 456697 [binary:456648.3,456684] -c_in(v_^f,c_^u^n^i^t^y_^oconstrains(c_minus(v_^a,v_^b,tc_set(t_a)),c_union(v_^a,v_^b,t_a),t_a),tc_^u^n^i^t^y_^oprogram(t_a)) | -c_in(v_^f,c_^w^fair_^otransient(c_minus(v_^a,v_^b,tc_set(t_a)),t_a),tc_^u^n^i^t^y_^oprogram(t_a)).
% 456744 [binary:456645,456651] c_in(v_^f,c_^u^n^i^t^y_^oconstrains(X,c_union(v_^a,v_^b,t_a),t_a),tc_^u^n^i^t^y_^oprogram(t_a)) | -c_lessequals(X,v_^a,tc_set(t_a)).
% 456804 [binary:455443.2,456671.2] -c_in(X,c_^pow(v_^a,t_a),tc_set(t_a)) | c_in(v_^f,c_^w^fair_^otransient(X,t_a),tc_^u^n^i^t^y_^oprogram(t_a)).
% 459964 [binary:455431.2,456804.2] -c_in(v_^f,c_uminus(c_^w^fair_^otransient(X,t_a),tc_set(tc_^u^n^i^t^y_^oprogram(t_a))),tc_^u^n^i^t^y_^oprogram(t_a)) | -c_in(X,c_^pow(v_^a,t_a),tc_set(t_a)).
% 461518 [binary:455432.2,456697.2,binarydemod:456744,459964,binarycut:455444] -c_lessequals(c_minus(v_^a,v_^b,tc_set(t_a)),v_^a,tc_set(t_a)).
% 461610 [binary:455586.2,461518] c_in(c_^main_^osubset^i__1(c_minus(v_^a,v_^b,tc_set(t_a)),v_^a,t_a),c_minus(v_^a,v_^b,tc_set(t_a)),t_a).
% 461611 [binary:455587.2,461518] -c_in(c_^main_^osubset^i__1(c_minus(v_^a,v_^b,tc_set(t_a)),v_^a,t_a),v_^a,t_a).
% 461628 [binary:455437.2,461611,slowcut:461610] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 11245
% derived clauses: 1159005
% kept clauses: 188756
% kept size sum: 107706
% kept mid-nuclei: 46709
% kept new demods: 139
% forw unit-subs: 152394
% forw double-subs: 29180
% forw overdouble-subs: 6507
% backward subs: 84
% fast unit cutoff: 11124
% full unit cutoff: 6356
% dbl unit cutoff: 28
% real runtime : 85.3
% process. runtime: 84.81
% specific non-discr-tree subsumption statistics:
% tried: 218188
% length fails: 8555
% strength fails: 15405
% predlist fails: 27565
% aux str. fails: 2566
% by-lit fails: 4232
% full subs tried: 148554
% full subs fail: 142019
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP24624/COM/COM011-1+eq_r.in")
% WARNING: TreeLimitedRun lost 84.84s, total lost is 84.84s
% Killed 1 orphans
%
%------------------------------------------------------------------------------