TSTP Solution File: SYN084-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN084-2 : TPTP v5.0.0. Released v1.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art03.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 08:30:06 EST 2010
% Result : Unsatisfiable 121.02s
% Output : Refutation 121.02s
% 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/SystemOnTPTP27643/SYN/SYN084-2+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 = 0 secs [nr = 2] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 18] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 58] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 164] [nf = 8] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 376] [nf = 20] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 860] [nf = 32] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 1672] [nf = 44] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 7706] [nf = 352] [nu = 1309] [ut = 11]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 22020] [nf = 1548] [nu = 3569] [ut = 11]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 55676] [nf = 3176] [nu = 10773] [ut = 11]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 120322] [nf = 8448] [nu = 20921] [ut = 11]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 266090] [nf = 17944] [nu = 51041] [ut = 11]
% Looking for a proof at depth = 13 ...
% t = 2 secs [nr = 547112] [nf = 43876] [nu = 97593] [ut = 11]
% Looking for a proof at depth = 14 ...
% t = 3 secs [nr = 1171144] [nf = 82672] [nu = 226445] [ut = 11]
% Looking for a proof at depth = 15 ...
% t = 7 secs [nr = 2388914] [nf = 190616] [nu = 434353] [ut = 11]
% Looking for a proof at depth = 16 ...
% t = 15 secs [nr = 5041146] [nf = 378384] [nu = 980713] [ut = 11]
% Looking for a proof at depth = 17 ...
% t = 31 secs [nr = 10276804] [nf = 846940] [nu = 1905105] [ut = 11]
% Looking for a proof at depth = 18 ...
% t = 66 secs [nr = 21589836] [nf = 1635640] [nu = 4231093] [ut = 11]
% Looking for a proof at depth = 19 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 122 secs [nr = 39901816] [nf = 3335378] [nu = 7419700] [ut = 11]
% Looking for a proof at depth = 2 ...
% t = 122 secs [nr = 39901860] [nf = 3335378] [nu = 7419712] [ut = 11]
% Looking for a proof at depth = 3 ...
% t = 122 secs [nr = 39901949] [nf = 3335382] [nu = 7419724] [ut = 11]
% Looking for a proof at depth = 4 ...
% t = 122 secs [nr = 39902717] [nf = 3335424] [nu = 7419968] [ut = 11]
% Looking for a proof at depth = 5 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: big_p_1(a_0())
% B2: ~big_p_1(a_0()) | big_p_1(f_1(f_1(x0))) | big_p_1(x0)
% B5: ~big_p_1(sk2_0()) | ~big_p_1(sk1_0()) | big_p_1(f_1(sk1_0())) | big_p_1(f_1(sk2_0()))
% Unit Clauses:
% --------------
% U0: < d0 v0 dv0 f0 c1 t1 td1 b nc > big_p_1(a_0())
% U1: < d8 v0 dv0 f2 c1 t3 td3 > ~big_p_1(f_1(f_1(sk1_0())))
% U2: < d8 v0 dv0 f2 c1 t3 td3 > ~big_p_1(f_1(f_1(sk2_0())))
% U5: < d8 v0 dv0 f1 c1 t2 td2 > ~big_p_1(f_1(sk2_0()))
% U6: < d8 v0 dv0 f0 c1 t1 td1 > big_p_1(sk1_0())
% U8: < d8 v0 dv0 f1 c1 t2 td2 > ~big_p_1(f_1(sk1_0()))
% U11: < d5 v0 dv0 f1 c1 t2 td2 > big_p_1(f_1(sk2_0()))
% --------------- Start of Proof ---------------
% Derivation of unit clause U0:
% big_p_1(a_0()) ....... U0
% Derivation of unit clause U1:
% big_p_1(a_0()) ....... B0
% ~big_p_1(a_0()) | big_p_1(f_1(f_1(x0))) | big_p_1(x0) ....... B2
% big_p_1(f_1(f_1(x0))) | big_p_1(x0) ....... R1 [B0:L0, B2:L0]
% ~big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(f_1(f_1(sk1_0()))) ....... B1
% big_p_1(sk2_0()) | ~big_p_1(f_1(f_1(sk1_0()))) ....... R2 [R1:L0, B1:L0]
% ~big_p_1(f_1(f_1(sk1_0()))) | ~big_p_1(sk2_0()) | big_p_1(f_1(sk2_0())) ....... B6
% ~big_p_1(f_1(f_1(sk1_0()))) | ~big_p_1(f_1(f_1(sk1_0()))) | big_p_1(f_1(sk2_0())) ....... R3 [R2:L0, B6:L1]
% ~big_p_1(f_1(f_1(sk1_0()))) | big_p_1(f_1(sk2_0())) ....... R4 [R3:L0, R3:L1]
% ~big_p_1(a_0()) | ~big_p_1(f_1(x0)) | big_p_1(f_1(f_1(x0))) ....... B3
% ~big_p_1(f_1(f_1(sk1_0()))) | ~big_p_1(a_0()) | big_p_1(f_1(f_1(sk2_0()))) ....... R5 [R4:L1, B3:L1]
% big_p_1(a_0()) ....... U0
% ~big_p_1(f_1(f_1(sk1_0()))) | big_p_1(f_1(f_1(sk2_0()))) ....... R6 [R5:L1, U0:L0]
% ~big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(f_1(f_1(sk1_0()))) ....... B1
% ~big_p_1(f_1(f_1(sk1_0()))) | ~big_p_1(f_1(f_1(sk1_0()))) ....... R7 [R6:L1, B1:L0]
% ~big_p_1(f_1(f_1(sk1_0()))) ....... R8 [R7:L0, R7:L1]
% Derivation of unit clause U2:
% big_p_1(a_0()) ....... B0
% ~big_p_1(a_0()) | big_p_1(f_1(f_1(x0))) | big_p_1(x0) ....... B2
% big_p_1(f_1(f_1(x0))) | big_p_1(x0) ....... R1 [B0:L0, B2:L0]
% ~big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(f_1(f_1(sk1_0()))) ....... B1
% big_p_1(sk1_0()) | ~big_p_1(f_1(f_1(sk2_0()))) ....... R2 [R1:L0, B1:L1]
% ~big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(sk1_0()) | big_p_1(f_1(sk1_0())) ....... B4
% ~big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(f_1(f_1(sk2_0()))) | big_p_1(f_1(sk1_0())) ....... R3 [R2:L0, B4:L1]
% ~big_p_1(f_1(f_1(sk2_0()))) | big_p_1(f_1(sk1_0())) ....... R4 [R3:L0, R3:L1]
% ~big_p_1(a_0()) | ~big_p_1(f_1(x0)) | big_p_1(f_1(f_1(x0))) ....... B3
% ~big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(a_0()) | big_p_1(f_1(f_1(sk1_0()))) ....... R5 [R4:L1, B3:L1]
% big_p_1(a_0()) ....... U0
% ~big_p_1(f_1(f_1(sk2_0()))) | big_p_1(f_1(f_1(sk1_0()))) ....... R6 [R5:L1, U0:L0]
% ~big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(f_1(f_1(sk1_0()))) ....... B1
% ~big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(f_1(f_1(sk2_0()))) ....... R7 [R6:L1, B1:L1]
% ~big_p_1(f_1(f_1(sk2_0()))) ....... R8 [R7:L0, R7:L1]
% Derivation of unit clause U5:
% big_p_1(a_0()) ....... B0
% ~big_p_1(a_0()) | big_p_1(f_1(f_1(x0))) | big_p_1(x0) ....... B2
% big_p_1(f_1(f_1(x0))) | big_p_1(x0) ....... R1 [B0:L0, B2:L0]
% ~big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(sk1_0()) | big_p_1(f_1(sk1_0())) ....... B4
% big_p_1(f_1(f_1(sk1_0()))) | ~big_p_1(f_1(f_1(sk2_0()))) | big_p_1(f_1(sk1_0())) ....... R2 [R1:L1, B4:L1]
% ~big_p_1(f_1(f_1(sk1_0()))) ....... U1
% ~big_p_1(f_1(f_1(sk2_0()))) | big_p_1(f_1(sk1_0())) ....... R3 [R2:L0, U1:L0]
% ~big_p_1(a_0()) | ~big_p_1(f_1(x0)) | big_p_1(f_1(f_1(x0))) ....... B3
% ~big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(a_0()) | big_p_1(f_1(f_1(sk1_0()))) ....... R4 [R3:L1, B3:L1]
% big_p_1(a_0()) ....... U0
% ~big_p_1(f_1(f_1(sk2_0()))) | big_p_1(f_1(f_1(sk1_0()))) ....... R5 [R4:L1, U0:L0]
% ~big_p_1(a_0()) | ~big_p_1(f_1(x0)) | big_p_1(f_1(f_1(x0))) ....... B3
% big_p_1(f_1(f_1(sk1_0()))) | ~big_p_1(a_0()) | ~big_p_1(f_1(sk2_0())) ....... R6 [R5:L0, B3:L2]
% ~big_p_1(f_1(f_1(sk1_0()))) ....... U1
% ~big_p_1(a_0()) | ~big_p_1(f_1(sk2_0())) ....... R7 [R6:L0, U1:L0]
% big_p_1(a_0()) ....... U0
% ~big_p_1(f_1(sk2_0())) ....... R8 [R7:L0, U0:L0]
% Derivation of unit clause U6:
% big_p_1(a_0()) ....... B0
% ~big_p_1(a_0()) | big_p_1(f_1(f_1(x0))) | big_p_1(x0) ....... B2
% big_p_1(f_1(f_1(x0))) | big_p_1(x0) ....... R1 [B0:L0, B2:L0]
% ~big_p_1(f_1(f_1(sk1_0()))) | ~big_p_1(sk2_0()) | big_p_1(f_1(sk2_0())) ....... B6
% big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(f_1(f_1(sk1_0()))) | big_p_1(f_1(sk2_0())) ....... R2 [R1:L1, B6:L1]
% ~big_p_1(f_1(f_1(sk2_0()))) ....... U2
% ~big_p_1(f_1(f_1(sk1_0()))) | big_p_1(f_1(sk2_0())) ....... R3 [R2:L0, U2:L0]
% ~big_p_1(a_0()) | big_p_1(f_1(f_1(x0))) | big_p_1(x0) ....... B2
% big_p_1(f_1(sk2_0())) | ~big_p_1(a_0()) | big_p_1(sk1_0()) ....... R4 [R3:L0, B2:L1]
% big_p_1(a_0()) ....... U0
% big_p_1(f_1(sk2_0())) | big_p_1(sk1_0()) ....... R5 [R4:L1, U0:L0]
% ~big_p_1(a_0()) | ~big_p_1(f_1(x0)) | big_p_1(f_1(f_1(x0))) ....... B3
% big_p_1(sk1_0()) | ~big_p_1(a_0()) | big_p_1(f_1(f_1(sk2_0()))) ....... R6 [R5:L0, B3:L1]
% big_p_1(a_0()) ....... U0
% big_p_1(sk1_0()) | big_p_1(f_1(f_1(sk2_0()))) ....... R7 [R6:L1, U0:L0]
% ~big_p_1(f_1(f_1(sk2_0()))) ....... U2
% big_p_1(sk1_0()) ....... R8 [R7:L1, U2:L0]
% Derivation of unit clause U8:
% big_p_1(a_0()) ....... B0
% ~big_p_1(a_0()) | big_p_1(f_1(f_1(x0))) | big_p_1(x0) ....... B2
% big_p_1(f_1(f_1(x0))) | big_p_1(x0) ....... R1 [B0:L0, B2:L0]
% ~big_p_1(f_1(f_1(sk1_0()))) | ~big_p_1(sk2_0()) | big_p_1(f_1(sk2_0())) ....... B6
% big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(f_1(f_1(sk1_0()))) | big_p_1(f_1(sk2_0())) ....... R2 [R1:L1, B6:L1]
% ~big_p_1(f_1(f_1(sk2_0()))) ....... U2
% ~big_p_1(f_1(f_1(sk1_0()))) | big_p_1(f_1(sk2_0())) ....... R3 [R2:L0, U2:L0]
% ~big_p_1(a_0()) | ~big_p_1(f_1(x0)) | big_p_1(f_1(f_1(x0))) ....... B3
% ~big_p_1(f_1(f_1(sk1_0()))) | ~big_p_1(a_0()) | big_p_1(f_1(f_1(sk2_0()))) ....... R4 [R3:L1, B3:L1]
% big_p_1(a_0()) ....... U0
% ~big_p_1(f_1(f_1(sk1_0()))) | big_p_1(f_1(f_1(sk2_0()))) ....... R5 [R4:L1, U0:L0]
% ~big_p_1(a_0()) | ~big_p_1(f_1(x0)) | big_p_1(f_1(f_1(x0))) ....... B3
% big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(a_0()) | ~big_p_1(f_1(sk1_0())) ....... R6 [R5:L0, B3:L2]
% ~big_p_1(f_1(f_1(sk2_0()))) ....... U2
% ~big_p_1(a_0()) | ~big_p_1(f_1(sk1_0())) ....... R7 [R6:L0, U2:L0]
% big_p_1(a_0()) ....... U0
% ~big_p_1(f_1(sk1_0())) ....... R8 [R7:L0, U0:L0]
% Derivation of unit clause U11:
% ~big_p_1(a_0()) | big_p_1(f_1(f_1(x0))) | big_p_1(x0) ....... B2
% ~big_p_1(sk2_0()) | ~big_p_1(sk1_0()) | big_p_1(f_1(sk1_0())) | big_p_1(f_1(sk2_0())) ....... B5
% ~big_p_1(a_0()) | big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(sk1_0()) | big_p_1(f_1(sk1_0())) | big_p_1(f_1(sk2_0())) ....... R1 [B2:L2, B5:L0]
% big_p_1(a_0()) ....... U0
% big_p_1(f_1(f_1(sk2_0()))) | ~big_p_1(sk1_0()) | big_p_1(f_1(sk1_0())) | big_p_1(f_1(sk2_0())) ....... R2 [R1:L0, U0:L0]
% ~big_p_1(f_1(f_1(sk2_0()))) ....... U2
% ~big_p_1(sk1_0()) | big_p_1(f_1(sk1_0())) | big_p_1(f_1(sk2_0())) ....... R3 [R2:L0, U2:L0]
% big_p_1(sk1_0()) ....... U6
% big_p_1(f_1(sk1_0())) | big_p_1(f_1(sk2_0())) ....... R4 [R3:L0, U6:L0]
% ~big_p_1(f_1(sk1_0())) ....... U8
% big_p_1(f_1(sk2_0())) ....... R5 [R4:L0, U8:L0]
% Derivation of the empty clause:
% big_p_1(f_1(sk2_0())) ....... U11
% ~big_p_1(f_1(sk2_0())) ....... U5
% [] ....... R1 [U11:L0, U5:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 43239949
% resolvents: 39904287 factors: 3335662
% Number of unit clauses generated: 7420137
% % unit clauses generated to total clauses generated: 17.16
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 1 [5] = 1 [8] = 10
% Total = 12
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 7420137 [2] = 16201684 [3] = 19617559 [4] = 493 [5] = 76
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] big_p_1 (+)8 (-)4
% ------------------
% Total: (+)8 (-)4
% Total number of unit clauses retained: 12
% Number of clauses skipped because of their length: 38203291
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 4738915
% Number of successful unifications: 43239994
% Number of unification failures: 271314050
% Number of unit to unit unification failures: 30
% N literal unification failure due to lookup root_id table: 235895362
% N base clause resolution failure due to lookup table: 11111470
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 10
% N unit clauses dropped because they exceeded max values: 3520129
% N unit clauses dropped because too much nesting: 1225134
% 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: 5
% Max term depth in a unit clause: 5
% Number of states in UCFA table: 11
% Total number of terms of all unit clauses in table: 33
% Max allowed number of states in UCFA: 56000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 0.33
% Number of symbols (columns) in UCFA: 39
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 314554044
% ConstructUnitClause() = 3520140
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 3.71 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 357355
% | |
% --------------------------------------------------------
% Elapsed time: 122 secs
% CPU time: 121.00 secs
%
%------------------------------------------------------------------------------