TSTP Solution File: SYN554-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN554-1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art06.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Nov 28 10:20:00 EST 2010
% Result : Unsatisfiable 0.16s
% Output : Refutation 0.16s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Command entered:
% /home/graph/tptp/Systems/CARINE---0.734/carine /tmp/SystemOnTPTP4284/SYN/SYN554-1+noeq.car t=300 xo=off uct=32000
% CARINE version 0.734 (Dec 2003)
% Initializing tables ... done.
% Parsing ......... done.
% Calculating time slices ... done.
% Building Lookup Tables ... done.
% Looking for a proof at depth = 1 ...
% t = 1 secs [nr = 16] [nf = 0] [nu = 2] [ut = 4]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 147] [nf = 8] [nu = 70] [ut = 10]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 1460] [nf = 130] [nu = 783] [ut = 24]
% Looking for a proof at depth = 4 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: p2_2(x0,x0)
% B1: ~p2_2(c6_0(),c7_0())
% B5: ~p2_2(x2,x0) | ~p2_2(x2,x1) | p2_2(x0,x1)
% B6: p2_2(x0,x1) | p4_2(x0,x1) | p4_2(x1,x0)
% B7: ~p2_2(x3,x0) | ~p2_2(x2,x1) | ~p4_2(x3,x2) | p4_2(x0,x1)
% Unit Clauses:
% --------------
% U0: < d0 v2 dv1 f0 c0 t2 td1 b nc > p2_2(x0,x0)
% U2: < d0 v0 dv0 f2 c4 t6 td2 b nc > p2_2(f3_2(c5_0(),c6_0()),f3_2(c5_0(),c7_0()))
% U3: < d0 v2 dv1 f0 c0 t2 td1 b nc > ~p4_2(x0,x0)
% U4: < d2 v0 dv0 f2 c4 t6 td2 > p2_2(f3_2(c5_0(),c7_0()),f3_2(c5_0(),c6_0()))
% U10: < d3 v0 dv0 f2 c4 t6 td2 > ~p4_2(f3_2(c5_0(),c7_0()),f3_2(c5_0(),c6_0()))
% U11: < d3 v0 dv0 f2 c4 t6 td2 > ~p4_2(f3_2(c5_0(),c6_0()),f3_2(c5_0(),c7_0()))
% U16: < d3 v0 dv0 f0 c2 t2 td1 > p4_2(c7_0(),c6_0())
% U37: < d4 v0 dv0 f2 c4 t6 td2 > p4_2(f3_2(c5_0(),c7_0()),f3_2(c5_0(),c6_0()))
% --------------- Start of Proof ---------------
% Derivation of unit clause U0:
% p2_2(x0,x0) ....... U0
% Derivation of unit clause U2:
% p2_2(f3_2(c5_0(),c6_0()),f3_2(c5_0(),c7_0())) ....... U2
% Derivation of unit clause U3:
% ~p4_2(x0,x0) ....... U3
% Derivation of unit clause U4:
% p2_2(x0,x0) ....... B0
% ~p2_2(x2,x0) | ~p2_2(x2,x1) | p2_2(x0,x1) ....... B5
% ~p2_2(x0, x1) | p2_2(x1, x0) ....... R1 [B0:L0, B5:L1]
% p2_2(f3_2(c5_0(),c6_0()),f3_2(c5_0(),c7_0())) ....... U2
% p2_2(f3_2(c5_0(), c7_0()), f3_2(c5_0(), c6_0())) ....... R2 [R1:L0, U2:L0]
% Derivation of unit clause U10:
% p2_2(x0,x0) ....... B0
% ~p2_2(x3,x0) | ~p2_2(x2,x1) | ~p4_2(x3,x2) | p4_2(x0,x1) ....... B7
% ~p2_2(x0, x1) | ~p4_2(x2, x0) | p4_2(x2, x1) ....... R1 [B0:L0, B7:L0]
% p2_2(f3_2(c5_0(),c6_0()),f3_2(c5_0(),c7_0())) ....... U2
% ~p4_2(x0, f3_2(c5_0(), c6_0())) | p4_2(x0, f3_2(c5_0(), c7_0())) ....... R2 [R1:L0, U2:L0]
% ~p4_2(x0,x0) ....... U3
% ~p4_2(f3_2(c5_0(), c7_0()), f3_2(c5_0(), c6_0())) ....... R3 [R2:L1, U3:L0]
% Derivation of unit clause U11:
% p2_2(x0,x0) ....... B0
% ~p2_2(x3,x0) | ~p2_2(x2,x1) | ~p4_2(x3,x2) | p4_2(x0,x1) ....... B7
% ~p2_2(x0, x1) | ~p4_2(x2, x0) | p4_2(x2, x1) ....... R1 [B0:L0, B7:L0]
% p2_2(f3_2(c5_0(),c7_0()),f3_2(c5_0(),c6_0())) ....... U4
% ~p4_2(x0, f3_2(c5_0(), c7_0())) | p4_2(x0, f3_2(c5_0(), c6_0())) ....... R2 [R1:L0, U4:L0]
% ~p4_2(x0,x0) ....... U3
% ~p4_2(f3_2(c5_0(), c6_0()), f3_2(c5_0(), c7_0())) ....... R3 [R2:L1, U3:L0]
% Derivation of unit clause U16:
% ~p2_2(c6_0(),c7_0()) ....... B1
% p2_2(x0,x1) | p4_2(x0,x1) | p4_2(x1,x0) ....... B6
% p4_2(c6_0(), c7_0()) | p4_2(c7_0(), c6_0()) ....... R1 [B1:L0, B6:L0]
% ~p4_2(x0,x1) | p4_2(f3_2(c5_0(),x0),f3_2(c5_0(),x1)) ....... B4
% p4_2(c7_0(), c6_0()) | p4_2(f3_2(c5_0(), c6_0()), f3_2(c5_0(), c7_0())) ....... R2 [R1:L0, B4:L0]
% ~p4_2(f3_2(c5_0(),c6_0()),f3_2(c5_0(),c7_0())) ....... U11
% p4_2(c7_0(), c6_0()) ....... R3 [R2:L1, U11:L0]
% Derivation of unit clause U37:
% p2_2(x0,x0) ....... B0
% ~p2_2(x3,x0) | ~p2_2(x2,x1) | ~p4_2(x3,x2) | p4_2(x0,x1) ....... B7
% ~p2_2(x0, x1) | ~p4_2(x2, x0) | p4_2(x2, x1) ....... R1 [B0:L0, B7:L0]
% p2_2(x0,x0) ....... U0
% ~p4_2(x0, x1) | p4_2(x0, x1) ....... R2 [R1:L0, U0:L0]
% ~p4_2(x0,x1) | p4_2(f3_2(c5_0(),x0),f3_2(c5_0(),x1)) ....... B4
% ~p4_2(x0, x1) | p4_2(f3_2(c5_0(), x0), f3_2(c5_0(), x1)) ....... R3 [R2:L1, B4:L0]
% p4_2(c7_0(),c6_0()) ....... U16
% p4_2(f3_2(c5_0(), c7_0()), f3_2(c5_0(), c6_0())) ....... R4 [R3:L0, U16:L0]
% Derivation of the empty clause:
% p4_2(f3_2(c5_0(),c7_0()),f3_2(c5_0(),c6_0())) ....... U37
% ~p4_2(f3_2(c5_0(),c7_0()),f3_2(c5_0(),c6_0())) ....... U10
% [] ....... R1 [U37:L0, U10:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 10480
% resolvents: 10330 factors: 150
% Number of unit clauses generated: 9048
% % unit clauses generated to total clauses generated: 86.34
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 4 [2] = 6 [3] = 14
% [4] = 14
% Total = 38
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 9048 [2] = 1240 [3] = 192
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] p2_2 (+)23 (-)2
% [1] p4_2 (+)3 (-)10
% ------------------
% Total: (+)26 (-)12
% Total number of unit clauses retained: 38
% Number of clauses skipped because of their length: 2327
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 10495
% Number of unification failures: 5295
% Number of unit to unit unification failures: 67
% N literal unification failure due to lookup root_id table: 1031
% N base clause resolution failure due to lookup table: 977
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 9
% N unit clauses dropped because they exceeded max values: 8823
% N unit clauses dropped because too much nesting: 0
% N unit clauses not constrcuted because table was full: 0
% N unit clauses dropped because UCFA table was full: 0
% Max number of terms in a unit clause: 6
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 95
% Total number of terms of all unit clauses in table: 180
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 0.53
% Number of symbols (columns) in UCFA: 40
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 15790
% ConstructUnitClause() = 8857
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.16 secs
%
%------------------------------------------------------------------------------