TSTP Solution File: LCL098-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL098-1 : 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 : art07.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/LCL098-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 7 5)
% (binary-unit 11 #f 7 5)
% (binary-double 17 #f 7 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 7 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,0,6,0,0)
%
%
% START OF PROOF
% 4 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 5 [] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V),V)).
% 6 [] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))).
% 9 [hyper:4,5,5] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(U,Y),equivalent(equivalent(X,U),Z)))).
% 12 [hyper:4,9,9] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Z,U),X),equivalent(equivalent(V,U),equivalent(equivalent(Z,V),Y))))).
% 14 [hyper:4,9,5] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(equivalent(Z,U),equivalent(Z,V)),X),equivalent(equivalent(U,V),Y)))).
% 20 [hyper:4,12,5] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Z,U),equivalent(Z,V)),W)),equivalent(equivalent(X1,Y),equivalent(equivalent(X,X1),equivalent(equivalent(U,V),W))))).
% 29 [hyper:4,14,5] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(equivalent(equivalent(U,V),equivalent(U,W)),X1)),equivalent(equivalent(Y,Z),equivalent(equivalent(V,W),X1)))).
% 45 [hyper:4,20,14] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(equivalent(Z,U),V),X),equivalent(equivalent(equivalent(Z,W),V),equivalent(equivalent(U,W),Y))))).
% 85 [hyper:4,45,5] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(equivalent(U,V),equivalent(U,W)),X1)),equivalent(equivalent(equivalent(X,X2),Z),equivalent(equivalent(Y,X2),equivalent(equivalent(V,W),X1))))).
% 133 [hyper:4,29,5] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),U)),V),equivalent(equivalent(equivalent(Z,Y),U),V))).
% 174 [hyper:4,133,5] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Z),U)),V),equivalent(equivalent(X,equivalent(equivalent(equivalent(W,Y),equivalent(W,Z)),U)),V))).
% 188 [hyper:4,133,14] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(equivalent(equivalent(U,V),equivalent(equivalent(W,U),X1)),X2)),equivalent(equivalent(Y,Z),equivalent(equivalent(equivalent(W,V),X1),X2)))).
% 620 [hyper:4,85,5] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),U),V),equivalent(equivalent(equivalent(X,equivalent(Y,W)),U),equivalent(equivalent(Z,W),V)))).
% 683 [hyper:4,620,5] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),V)),W),equivalent(equivalent(U,V),W))).
% 3910 [hyper:4,188,9] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),U),equivalent(equivalent(equivalent(X,V),Z),equivalent(equivalent(W,equivalent(Y,V)),equivalent(W,U))))).
% 3979 [hyper:4,3910,5] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),V),W),equivalent(equivalent(X1,equivalent(equivalent(equivalent(Y,Z),U),V)),equivalent(X1,W)))).
% 4177 [hyper:4,3979,683] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,Z),U),equivalent(equivalent(V,Z),W)),X1)),equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,V),U),W),X1)))).
% 4365 [hyper:4,4177,174] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),U),equivalent(equivalent(V,Z),W)),X1),equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,V)),U),W),X1))).
% 4502 [hyper:4,4365,5] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(U,V)),equivalent(equivalent(Y,Z),equivalent(U,W))),X1),equivalent(equivalent(V,W),X1))).
% 4755 [hyper:4,4502,5,slowcut:6] 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 7
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 329
% derived clauses: 130119
% kept clauses: 3937
% kept size sum: 150828
% kept mid-nuclei: 809
% kept new demods: 0
% forw unit-subs: 11915
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.96
% process. runtime: 1.94
% 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/LCL098-1+noeq.in")
%
%------------------------------------------------------------------------------