TSTP Solution File: SYN597-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN597-1 : TPTP v3.4.2. Released v2.5.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art02.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/SYN/SYN597-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 57 #f 5 7)
% (binary-unit 28 #f 5 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 5 7)
% (binary 28 #t 5 7)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(28,40,0,56,0,0,374130,4,4277,374134,50,4294,374134,40,4294,374162,0,4294)
%
%
% START OF PROOF
% 374135 [] p10(f11(X,Y,Z),f11(U,V,W)) | -p2(X,U) | -p9(Y,V) | -p10(Z,W).
% 374136 [] p12(f14(X,Y),f14(Z,U)) | -p3(X,Z) | -p3(Y,U).
% 374137 [] p2(f13(X,Y),f13(Z,U)) | -p12(Y,U) | -p3(X,Z).
% 374139 [] -p18(X,Y) | -p2(X,Z) | -p10(Y,U) | p18(Z,U).
% 374141 [] p18(c20,f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)).
% 374150 [] p3(f4(X),f4(Y)) | -p2(X,Y).
% 374155 [] p3(c21,c22).
% 374158 [] p2(X,X).
% 374159 [] p3(X,X).
% 374160 [] p9(X,X).
% 374161 [] p10(X,X).
% 374162 [] -p18(c20,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)).
% 374186 [binary:374155,374136.3] p12(f14(X,c21),f14(Y,c22)) | -p3(X,Y).
% 374223 [binary:374159,374137.3] p2(f13(X,Y),f13(X,Z)) | -p12(Y,Z).
% 374298 [binary:374162,374139.4] -p10(X,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)) | -p2(Y,c20) | -p18(Y,X).
% 374395 [binary:374141,374298.3,cut:374158] -p10(f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)).
% 374627 [binary:374135,374395,cut:374160,cut:374161,binarydemod:374150,374186,374223,cut:374158] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit 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 7
% clause depth limited to 5
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2499
% derived clauses: 1205035
% kept clauses: 77429
% kept size sum: 4826
% kept mid-nuclei: 24093
% kept new demods: 0
% forw unit-subs: 239587
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 3
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 42.97
% process. runtime: 42.94
% specific non-discr-tree subsumption statistics:
% tried: 2637
% length fails: 0
% strength fails: 29
% predlist fails: 2497
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 111
% full subs fail: 111
%
% ; 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/SYN/SYN597-1+noeq.in")
%
%------------------------------------------------------------------------------