TSTP Solution File: SYN096-1.008 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN096-1.008 : TPTP v3.4.2. Bugfixed v1.2.1.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.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/SYN/SYN096-1.008+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (hyper 12 #t 1 5)
% (binary-unit 30 #f 1 5)
% (binary-posweight-order 90 #f 1 5)
% (binary-double 30 #f)
% (binary 48 #t 1 5)
% (hyper 30 #f)
% (binary-posweight-order 180 #f)
% (binary-weightorder 42 #f)
% (binary-order 30 #f)
% (binary-unit 48 #f)
% (binary 60 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(65,40,0,130,0,0,131,50,0,196,0,0,197,50,0,262,0,0,263,50,0,328,0,0,329,50,0,394,0,0,395,50,0,460,0,0,461,50,0,526,0,0,527,50,0,592,0,1,593,50,1,658,0,1,659,50,1,724,0,1,725,50,1,790,0,1,791,50,1,856,0,1,857,50,1,922,0,1,923,50,1,988,0,1,989,50,1,1054,0,1,1055,50,1,1120,0,1,1121,50,1,1186,0,1,1187,50,1,1252,0,1,1253,50,1,1318,0,2,1319,50,2,1384,0,2,1385,50,2,1450,0,2,1451,50,2,1451,40,2,1516,0,2)
%
%
% START OF PROOF
% 1452 [] -p_2(X) | -p_1(X) | p_0(X).
% 1454 [] -p_3(X) | -p_2(X) | p_1(X).
% 1456 [] -p_4(X) | -p_3(X) | p_2(X).
% 1458 [] -p_5(X) | -p_4(X) | p_3(X).
% 1460 [] -p_6(X) | -p_5(X) | p_4(X).
% 1462 [] -p_7(X) | -p_6(X) | p_5(X).
% 1464 [] -p_8(X) | -p_7(X) | p_6(X).
% 1466 [] -p_9(X) | -p_8(X) | p_7(X).
% 1468 [] -p_10(X) | -p_9(X) | p_8(X).
% 1470 [] -p_11(X) | -p_10(X) | p_9(X).
% 1472 [] -p_12(X) | -p_11(X) | p_10(X).
% 1474 [] -p_13(X) | -p_12(X) | p_11(X).
% 1476 [] -p_14(X) | -p_13(X) | p_12(X).
% 1478 [] -p_15(X) | -p_14(X) | p_13(X).
% 1480 [] -q_2(X) | -p_1(X) | q_0(X).
% 1484 [] -q_4(X) | -p_3(X) | q_2(X).
% 1488 [] -q_6(X) | -p_5(X) | q_4(X).
% 1492 [] -q_8(X) | -p_7(X) | q_6(X).
% 1496 [] -q_10(X) | -p_9(X) | q_8(X).
% 1500 [] -q_12(X) | -p_11(X) | q_10(X).
% 1504 [] -q_14(X) | -p_13(X) | q_12(X).
% 1512 [] p_14(a).
% 1513 [] p_15(a).
% 1514 [] q_14(a).
% 1516 [] -q_0(X) | -p_0(X).
% 1553 [binary:1512,1478.2,cut:1513] p_13(a).
% 1555 [binary:1476.2,1553,cut:1512] p_12(a).
% 1558 [binary:1474.2,1555,cut:1553] p_11(a).
% 1561 [binary:1472.2,1558,cut:1555] p_10(a).
% 1563 [binary:1470.2,1561,cut:1558] p_9(a).
% 1565 [binary:1468.2,1563,cut:1561] p_8(a).
% 1568 [binary:1466.2,1565,cut:1563] p_7(a).
% 1571 [binary:1464.2,1568,cut:1565] p_6(a).
% 1573 [binary:1462.2,1571,cut:1568] p_5(a).
% 1575 [binary:1460.2,1573,cut:1571] p_4(a).
% 1577 [binary:1458.2,1575,cut:1573] p_3(a).
% 1579 [binary:1456.2,1577,cut:1575] p_2(a).
% 1582 [binary:1454.2,1579,cut:1577] p_1(a).
% 1585 [binary:1452.2,1582,cut:1579] p_0(a).
% 1587 [binary:1516.2,1585] -q_0(a).
% 1588 [binary:1480.3,1587,cut:1582] -q_2(a).
% 1593 [binary:1577,1484.2,cut:1588] -q_4(a).
% 1599 [binary:1573,1488.2,cut:1593] -q_6(a).
% 1605 [binary:1568,1492.2,cut:1599] -q_8(a).
% 1611 [binary:1563,1496.2,cut:1605] -q_10(a).
% 1617 [binary:1558,1500.2,cut:1611] -q_12(a).
% 1623 [binary:1514,1504,cut:1553,cut:1617] 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 5
% clause depth limited to 1
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 114
% derived clauses: 164
% kept clauses: 46
% kept size sum: 126
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 36
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 17
% fast unit cutoff: 28
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.4
% process. runtime: 0.3
% 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/SYN/SYN096-1.008+noeq.in")
%
%------------------------------------------------------------------------------