TSTP Solution File: SYN090-1.008 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN090-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 : art10.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/SYN090-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)
%
%
% SOS clause
% -p_0(0) | -q_0(0).
% was split for some strategies as:
% -p_0(0).
% -q_0(0).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(65,40,0,130,0,1,131,50,1,196,0,1,197,50,1,262,0,1,263,50,1,328,0,1,329,50,1,394,0,1,395,50,1,460,0,1,461,50,1,526,0,1,527,50,1,592,0,1,593,50,2,658,0,2,659,50,2,724,0,2,725,50,2,790,0,2,791,50,2,856,0,2,857,50,2,922,0,2,923,50,2,988,0,2,989,50,2,1054,0,2,1055,50,2,1120,0,2,1121,50,2,1186,0,2,1187,50,2,1252,0,2,1253,50,2,1318,0,3,1319,50,3,1384,0,3,1385,50,3,1450,0,3,1451,50,3,1451,40,3,1516,0,3)
%
%
% START OF PROOF
% 1452 [] -p_2(0) | -p_1(0) | p_0(0).
% 1454 [] -p_3(0) | -p_2(0) | p_1(0).
% 1456 [] -p_4(0) | -p_3(0) | p_2(0).
% 1458 [] -p_5(0) | -p_4(0) | p_3(0).
% 1460 [] -p_6(0) | -p_5(0) | p_4(0).
% 1462 [] -p_7(0) | -p_6(0) | p_5(0).
% 1464 [] -p_8(0) | -p_7(0) | p_6(0).
% 1466 [] -p_9(0) | -p_8(0) | p_7(0).
% 1468 [] -p_10(0) | -p_9(0) | p_8(0).
% 1470 [] -p_11(0) | -p_10(0) | p_9(0).
% 1472 [] -p_12(0) | -p_11(0) | p_10(0).
% 1474 [] -p_13(0) | -p_12(0) | p_11(0).
% 1476 [?] ?
% 1478 [?] ?
% 1481 [] -q_1(0) | -p_2(0) | q_0(0).
% 1482 [] -q_3(0) | -p_2(0) | q_1(0).
% 1487 [?] ?
% 1488 [?] ?
% 1492 [?] ?
% 1496 [?] ?
% 1500 [?] ?
% 1504 [?] ?
% 1512 [] p_14(0).
% 1513 [] p_15(0).
% 1514 [] q_14(0).
% 1516 [] -q_0(0) | -p_0(0).
% 1544 [input:1476,cut:1512] -p_13(0) | p_12(0).
% 1546 [input:1478,cut:1513,cut:1512] p_13(0).
% 1548 [binary:1544,1546] p_12(0).
% 1549 [binary:1472,1548] -p_11(0) | p_10(0).
% 1550 [binary:1474,1546,cut:1548] p_11(0).
% 1553 [binary:1550,1549] p_10(0).
% 1555 [binary:1468,1553] -p_9(0) | p_8(0).
% 1557 [binary:1470,1550,cut:1553] p_9(0).
% 1560 [binary:1557,1555] p_8(0).
% 1562 [binary:1464,1560] -p_7(0) | p_6(0).
% 1563 [binary:1466,1557,cut:1560] p_7(0).
% 1567 [binary:1563,1562] p_6(0).
% 1568 [binary:1460,1567] -p_5(0) | p_4(0).
% 1569 [binary:1462,1563,cut:1567] p_5(0).
% 1572 [binary:1569,1568] p_4(0).
% 1573 [binary:1456,1572] -p_3(0) | p_2(0).
% 1575 [binary:1458,1569,cut:1572] p_3(0).
% 1578 [binary:1575,1573] p_2(0).
% 1579 [binary:1452,1578] -p_1(0) | p_0(0).
% 1581 [binary:1482.2,1578] -q_3(0) | q_1(0).
% 1582 [binary:1454,1575,cut:1578] p_1(0).
% 1585 [binary:1582,1579] p_0(0).
% 1588 [binary:1516.2,1585] -q_0(0).
% 1589 [binary:1481.2,1578,cut:1588] -q_1(0).
% 1591 [binary:1589,1581.2] -q_3(0).
% 1599 [input:1487,cut:1591] -p_5(0) | -q_4(0).
% 1600 [binary:1569,1599] -q_4(0).
% 1601 [input:1488,cut:1600] -q_6(0) | -p_5(0).
% 1602 [binary:1569,1601.2] -q_6(0).
% 1606 [input:1492,cut:1602] -q_8(0) | -p_7(0).
% 1607 [binary:1563,1606.2] -q_8(0).
% 1609 [input:1496,cut:1607] -q_10(0) | -p_9(0).
% 1610 [binary:1557,1609.2] -q_10(0).
% 1614 [input:1500,cut:1610] -q_12(0) | -p_11(0).
% 1615 [binary:1550,1614.2] -q_12(0).
% 1617 [input:1504,cut:1514,cut:1615] -p_13(0).
% 1618 [binary:1546,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: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 109
% derived clauses: 126
% kept clauses: 35
% kept size sum: 104
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 3
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 80
% fast unit cutoff: 26
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.3
% 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/SYN090-1.008+noeq.in")
%
%------------------------------------------------------------------------------