TSTP Solution File: LCL109-5 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL109-5 : 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 : art03.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 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: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LCL/LCL109-5+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: short
%
% strategies selected:
% (binary-posweight-order 57 #f 4 3)
% (binary-unit 28 #f 4 3)
% (binary-double 28 #f 4 3)
% (binary 45 #t 4 3)
% (hyper 11 #t 4 3)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(18,40,0,36,0,0)
%
%
% START OF PROOF
% 20 [] equal(implies(truth,X),X).
% 21 [] equal(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),truth).
% 22 [] equal(implies(implies(X,Y),Y),implies(implies(Y,X),X)).
% 24 [] equal(big_^v(X,Y),implies(implies(X,Y),Y)).
% 26 [] equal(implies(X,Y),truth) | -ordered(X,Y).
% 27 [] -equal(implies(X,Y),truth) | ordered(X,Y).
% 28 [] ordered(implies(X,Y),implies(Z,Y)) | -ordered(X,Z).
% 36 [] -equal(big_^v(implies(x,y),implies(y,x)),truth).
% 42 [para:20.1.1,24.1.2.1] equal(big_^v(truth,X),implies(X,X)).
% 50 [para:20.1.1,21.1.1.1,demod:24,20,binarydemod:27] ordered(X,big_^v(X,Y)).
% 69 [para:42.1.1,50.1.2] ordered(truth,implies(X,X)).
% 70 [binary:26.2,69,demod:20] equal(implies(X,X),truth).
% 76 [para:20.1.1,22.1.1.1,demod:24,70] equal(truth,big_^v(X,truth)).
% 78 [para:22.1.1,24.1.2,demod:24] equal(big_^v(X,Y),big_^v(Y,X)).
% 87 [para:76.1.2,50.1.2] ordered(X,truth).
% 98 [para:78.1.1,36.1.1] -equal(big_^v(implies(y,x),implies(x,y)),truth).
% 136 [binary:87,28.2,demod:20] ordered(implies(X,Y),Y).
% 141 [binary:26.2,136,demod:24,slowcut:98] 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: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 36
% derived clauses: 378
% kept clauses: 98
% kept size sum: 950
% kept mid-nuclei: 0
% kept new demods: 59
% forw unit-subs: 254
% forw double-subs: 2
% forw overdouble-subs: 0
% backward subs: 4
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.1
% 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-5+eq_r.in")
%
%------------------------------------------------------------------------------