TSTP Solution File: LCL109-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL109-4 : 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 : art05.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 40.0s
% Output : Assurance 40.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/LCL/LCL109-4+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (binary-unit-uniteq 30 #f)
% (binary-posweight-order 120 #f 4 3)
% (binary-posweight-order 240 #f)
% (binary-posweight-lex-big-order 60 #f)
% (binary-posweight-lex-small-order 12 #f)
% (binary-weightorder 24 #f)
% (hyper 30 #f)
% (binary 24 #t)
% (binary-order 30 #f)
% (binary-unit 30 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(10,40,0,20,0,0,44712,3,1501,58898,4,2251,71801,5,3001,71801,1,3001,71801,50,3007,71801,40,3007,71811,0,3007)
%
%
% START OF PROOF
% 71803 [] equal(implies(truth,X),X).
% 71804 [] equal(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),truth).
% 71805 [] equal(implies(implies(X,Y),Y),implies(implies(Y,X),X)).
% 71806 [] equal(implies(implies(not(X),not(Y)),implies(Y,X)),truth).
% 71807 [] equal(big_^v(X,Y),implies(implies(X,Y),Y)).
% 71808 [] equal(big_hat(X,Y),not(big_^v(not(X),not(Y)))).
% 71809 [] equal(implies(X,Y),truth) | -ordered(X,Y).
% 71810 [] -equal(implies(X,Y),truth) | ordered(X,Y).
% 71811 [] -equal(big_^v(implies(x,y),implies(y,x)),truth).
% 71817 [para:71803.1.1,71807.1.2.1] equal(big_^v(truth,X),implies(X,X)).
% 71819 [para:71807.1.2,71807.1.2.1] equal(big_^v(implies(X,Y),Y),implies(big_^v(X,Y),Y)).
% 71824 [para:71803.1.1,71804.1.1.1,demod:71807,71803] equal(implies(X,big_^v(X,Y)),truth).
% 71825 [para:71803.1.1,71804.1.1.1,demod:71807,71803,binarydemod:71810] ordered(X,big_^v(X,Y)).
% 71829 [para:71804.1.1,71807.1.2.1,demod:71803] equal(big_^v(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),implies(implies(Y,Z),implies(X,Z))).
% 71844 [para:71817.1.1,71825.1.2] ordered(truth,implies(X,X)).
% 71845 [binary:71809.2,71844,demod:71803] equal(implies(X,X),truth).
% 71851 [para:71803.1.1,71805.1.1.1,demod:71807,71845] equal(truth,big_^v(X,truth)).
% 71853 [para:71805.1.1,71807.1.2,demod:71807] equal(big_^v(X,Y),big_^v(Y,X)).
% 71859 [para:71805.1.1,71804.1.1.2.2,demod:71807,binarydemod:71810] ordered(implies(implies(X,Y),Z),implies(implies(Z,Y),big_^v(Y,X))).
% 71862 [para:71851.1.2,71825.1.2] ordered(X,truth).
% 71863 [binary:71809.2,71862] equal(implies(X,truth),truth).
% 71864 [para:71863.1.1,71804.1.1.1,demod:71803] equal(implies(X,implies(Y,X)),truth).
% 71867 [para:71803.1.1,71806.1.1.2] equal(implies(implies(not(X),not(truth)),X),truth).
% 71871 [para:71806.1.1,71805.1.1.1,demod:71807,71803] equal(implies(X,Y),big_^v(implies(X,Y),implies(not(Y),not(X)))).
% 71873 [para:71853.1.1,71811.1.1] -equal(big_^v(implies(y,x),implies(x,y)),truth).
% 71876 [para:71824.1.1,71804.1.1.1,demod:71803,binarydemod:71810] ordered(implies(big_^v(X,Y),Z),implies(X,Z)).
% 71882 [para:71864.1.1,71804.1.1.1,demod:71803,binarydemod:71810] ordered(implies(implies(X,Y),Z),implies(Y,Z)).
% 71886 [para:71853.1.1,71808.1.2.1,demod:71808] equal(big_hat(X,Y),big_hat(Y,X)).
% 71941 [para:71806.1.1,71882.1.1] ordered(truth,implies(not(X),implies(X,Y))).
% 71947 [binary:71809.2,71941,demod:71803] equal(implies(not(X),implies(X,Y)),truth).
% 71948 [binary:71809.2,71941,demod:71803,binarydemod:71810] ordered(not(X),implies(X,Y)).
% 71953 [para:71803.1.1,71948.1.2] ordered(not(truth),X).
% 71960 [binary:71809.2,71953] equal(implies(not(truth),X),truth).
% 71966 [para:71960.1.1,71805.1.1.1,demod:71807,71803] equal(X,big_^v(X,not(truth))).
% 72036 [para:71947.1.1,71805.1.1.1,demod:71807,71803] equal(implies(X,Y),big_^v(implies(X,Y),not(X))).
% 72050 [?] ?
% 72496 [para:71867.1.1,71805.1.1.1,demod:72050,71803] equal(X,implies(not(X),not(truth))).
% 72510 [para:72496.1.2,71807.1.2.1,demod:71966] equal(not(X),implies(X,not(truth))).
% 72519 [para:71808.1.2,72496.1.2.1,demod:72510] equal(big_^v(not(X),not(Y)),not(big_hat(X,Y))).
% 72522 [para:72496.1.2,71876.1.2,demod:72510] ordered(not(big_^v(not(X),Y)),X).
% 72555 [para:71808.1.2,72522.1.1] ordered(big_hat(X,Y),X).
% 72575 [binary:71809.2,72555] equal(implies(big_hat(X,Y),X),truth).
% 72643 [para:72510.1.2,71829.1.1.2.1,demod:71871,72510] equal(implies(X,Y),implies(not(Y),not(X))).
% 72668 [para:72575.1.1,71807.1.2.1,demod:71803] equal(big_^v(big_hat(X,Y),X),X).
% 72673 [para:72575.1.1,71805.1.1.1,demod:71807,71803] equal(X,big_^v(X,big_hat(X,Y))).
% 72718 [para:72668.1.1,71859.1.2.2] ordered(implies(implies(X,big_hat(X,Y)),Z),implies(implies(Z,big_hat(X,Y)),X)).
% 72721 [para:71886.1.1,72673.1.2.2] equal(X,big_^v(X,big_hat(Y,X))).
% 73296 [para:72643.1.2,71819.1.1.1,demod:72643,72519,72036] equal(implies(X,Y),implies(X,big_hat(Y,X))).
% 73797 [para:73296.1.2,71807.1.2.1,demod:72721] equal(X,implies(implies(X,Y),big_hat(Y,X))).
% 73798 [para:71886.1.1,73296.1.2.2] equal(implies(X,Y),implies(X,big_hat(X,Y))).
% 91237 [para:73797.1.2,72718.1.2.1,demod:73798] ordered(implies(implies(X,Y),implies(Y,X)),implies(Y,X)).
% 98342 [binary:71809.2,91237,demod:71807,slowcut:71873] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos 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 3
% clause depth limited to 4
% seconds given: 120
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5526
% derived clauses: 2118042
% kept clauses: 96661
% kept size sum: 377248
% kept mid-nuclei: 29
% kept new demods: 17721
% forw unit-subs: 1705810
% forw double-subs: 2636
% forw overdouble-subs: 0
% backward subs: 639
% fast unit cutoff: 14
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 49.69
% process. runtime: 49.35
% 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" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LCL/LCL109-4+eq_r.in")
%
%------------------------------------------------------------------------------