TSTP Solution File: SYN070-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN070-1 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art09.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:28:36 EST 2010
% Result : Unsatisfiable 31.03s
% Output : Refutation 31.03s
% 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/SystemOnTPTP31770/SYN/SYN070-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 = 0 secs [nr = 8] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 48] [nf = 0] [nu = 8] [ut = 6]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 120] [nf = 0] [nu = 16] [ut = 6]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 336] [nf = 0] [nu = 88] [ut = 10]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 840] [nf = 16] [nu = 160] [ut = 10]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 2868] [nf = 32] [nu = 994] [ut = 14]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 8668] [nf = 288] [nu = 1850] [ut = 14]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 36906] [nf = 544] [nu = 13976] [ut = 16]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 120890] [nf = 4472] [nu = 26240] [ut = 16]
% Looking for a proof at depth = 10 ...
% t = 2 secs [nr = 524674] [nf = 8400] [nu = 199728] [ut = 16]
% Looking for a proof at depth = 11 ...
% t = 4 secs [nr = 1724994] [nf = 67128] [nu = 373216] [ut = 16]
% Looking for a proof at depth = 12 ...
% t = 19 secs [nr = 7546738] [nf = 125856] [nu = 2879568] [ut = 16]
% Looking for a proof at depth = 13 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 32 secs [nr = 14967726] [nf = 494136] [nu = 3952037] [ut = 16]
% Looking for a proof at depth = 2 ...
% t = 32 secs [nr = 14967828] [nf = 494136] [nu = 3952047] [ut = 17]
% Looking for a proof at depth = 3 ...
% t = 32 secs [nr = 14968050] [nf = 494158] [nu = 3952059] [ut = 18]
% Looking for a proof at depth = 4 ...
% t = 32 secs [nr = 14972045] [nf = 494189] [nu = 3953587] [ut = 31]
% Looking for a proof at depth = 5 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: big_f_1(b_0())
% B2: ~big_f_1(x0) | big_f_1(a_0()) | big_g_1(x0)
% B3: ~big_f_1(x0) | ~big_g_1(a_0()) | big_g_1(x0)
% B7: ~big_f_1(x1) | ~big_f_1(x0) | ~big_h_2(x0,x1) | ~big_j_2(x1,x0)
% B8: ~big_f_1(x1) | ~big_f_1(x0) | big_g_1(x0) | big_g_1(x1) | big_j_2(a_0(),x1)
% Unit Clauses:
% --------------
% U1: < d0 v0 dv0 f0 c1 t1 td1 b nc > ~big_g_1(b_0())
% U3: < d2 v0 dv0 f0 c1 t1 td1 > ~big_g_1(a_0())
% U6: < d4 v0 dv0 f1 c1 t2 td2 > big_f_1(f_1(a_0()))
% U7: < d4 v0 dv0 f1 c1 t2 td2 > ~big_g_1(f_1(a_0()))
% U18: < d4 v0 dv0 f1 c2 t3 td2 > big_h_2(f_1(a_0()),a_0())
% U23: < d4 v0 dv0 f1 c2 t3 td2 > big_j_2(a_0(),f_1(a_0()))
% U34: < d5 v0 dv0 f1 c2 t3 td2 > ~big_j_2(a_0(),f_1(a_0()))
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% ~big_g_1(b_0()) ....... U1
% Derivation of unit clause U3:
% big_f_1(b_0()) ....... B0
% ~big_f_1(x0) | ~big_g_1(a_0()) | big_g_1(x0) ....... B3
% ~big_g_1(a_0()) | big_g_1(b_0()) ....... R1 [B0:L0, B3:L0]
% ~big_g_1(b_0()) ....... U1
% ~big_g_1(a_0()) ....... R2 [R1:L1, U1:L0]
% Derivation of unit clause U6:
% big_f_1(b_0()) ....... B0
% ~big_f_1(x0) | big_f_1(a_0()) | big_g_1(x0) ....... B2
% big_f_1(a_0()) | big_g_1(b_0()) ....... R1 [B0:L0, B2:L0]
% ~big_f_1(x0) | big_f_1(f_1(x0)) | big_g_1(x0) ....... B4
% big_g_1(b_0()) | big_f_1(f_1(a_0())) | big_g_1(a_0()) ....... R2 [R1:L0, B4:L0]
% ~big_g_1(b_0()) ....... U1
% big_f_1(f_1(a_0())) | big_g_1(a_0()) ....... R3 [R2:L0, U1:L0]
% ~big_g_1(a_0()) ....... U3
% big_f_1(f_1(a_0())) ....... R4 [R3:L1, U3:L0]
% Derivation of unit clause U7:
% big_f_1(b_0()) ....... B0
% ~big_f_1(x0) | big_f_1(a_0()) | big_g_1(x0) ....... B2
% big_f_1(a_0()) | big_g_1(b_0()) ....... R1 [B0:L0, B2:L0]
% ~big_f_1(x0) | ~big_g_1(f_1(x0)) | big_g_1(x0) ....... B5
% big_g_1(b_0()) | ~big_g_1(f_1(a_0())) | big_g_1(a_0()) ....... R2 [R1:L0, B5:L0]
% ~big_g_1(b_0()) ....... U1
% ~big_g_1(f_1(a_0())) | big_g_1(a_0()) ....... R3 [R2:L0, U1:L0]
% ~big_g_1(a_0()) ....... U3
% ~big_g_1(f_1(a_0())) ....... R4 [R3:L1, U3:L0]
% Derivation of unit clause U18:
% big_f_1(b_0()) ....... B0
% ~big_f_1(x0) | big_f_1(a_0()) | big_g_1(x0) ....... B2
% big_f_1(a_0()) | big_g_1(b_0()) ....... R1 [B0:L0, B2:L0]
% ~big_f_1(x0) | big_g_1(x0) | big_h_2(f_1(x0),x0) ....... B6
% big_g_1(b_0()) | big_g_1(a_0()) | big_h_2(f_1(a_0()), a_0()) ....... R2 [R1:L0, B6:L0]
% ~big_g_1(b_0()) ....... U1
% big_g_1(a_0()) | big_h_2(f_1(a_0()), a_0()) ....... R3 [R2:L0, U1:L0]
% ~big_g_1(a_0()) ....... U3
% big_h_2(f_1(a_0()), a_0()) ....... R4 [R3:L0, U3:L0]
% Derivation of unit clause U23:
% big_f_1(b_0()) ....... B0
% ~big_f_1(x1) | ~big_f_1(x0) | big_g_1(x0) | big_g_1(x1) | big_j_2(a_0(),x1) ....... B8
% ~big_f_1(x0) | big_g_1(b_0()) | big_g_1(x0) | big_j_2(a_0(), x0) ....... R1 [B0:L0, B8:L1]
% big_f_1(f_1(a_0())) ....... U6
% big_g_1(b_0()) | big_g_1(f_1(a_0())) | big_j_2(a_0(), f_1(a_0())) ....... R2 [R1:L0, U6:L0]
% ~big_g_1(b_0()) ....... U1
% big_g_1(f_1(a_0())) | big_j_2(a_0(), f_1(a_0())) ....... R3 [R2:L0, U1:L0]
% ~big_g_1(f_1(a_0())) ....... U7
% big_j_2(a_0(), f_1(a_0())) ....... R4 [R3:L0, U7:L0]
% Derivation of unit clause U34:
% ~big_f_1(x0) | big_f_1(a_0()) | big_g_1(x0) ....... B2
% ~big_f_1(x1) | ~big_f_1(x0) | ~big_h_2(x0,x1) | ~big_j_2(x1,x0) ....... B7
% ~big_f_1(x0) | big_g_1(x0) | ~big_f_1(x1) | ~big_h_2(x1, a_0()) | ~big_j_2(a_0(), x1) ....... R1 [B2:L1, B7:L0]
% big_g_1(x0) | ~big_f_1(x0) | ~big_h_2(x0, a_0()) | ~big_j_2(a_0(), x0) ....... R2 [R1:L0, R1:L2]
% ~big_g_1(f_1(a_0())) ....... U7
% ~big_f_1(f_1(a_0())) | ~big_h_2(f_1(a_0()), a_0()) | ~big_j_2(a_0(), f_1(a_0())) ....... R3 [R2:L0, U7:L0]
% big_f_1(f_1(a_0())) ....... U6
% ~big_h_2(f_1(a_0()), a_0()) | ~big_j_2(a_0(), f_1(a_0())) ....... R4 [R3:L0, U6:L0]
% big_h_2(f_1(a_0()),a_0()) ....... U18
% ~big_j_2(a_0(), f_1(a_0())) ....... R5 [R4:L0, U18:L0]
% Derivation of the empty clause:
% ~big_j_2(a_0(),f_1(a_0())) ....... U34
% big_j_2(a_0(),f_1(a_0())) ....... U23
% [] ....... R1 [U34:L0, U23:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 15473183
% resolvents: 14978166 factors: 495017
% Number of unit clauses generated: 3954398
% % unit clauses generated to total clauses generated: 25.56
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2 [2] = 5 [3] = 1
% [4] = 17 [5] = 4 [6] = 4 [8] = 2
% Total = 35
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 3954398 [2] = 4374846 [3] = 7142367 [4] = 1459 [5] = 113
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] big_f_1 (+)8 (-)0
% [1] big_g_1 (+)0 (-)8
% [2] big_h_2 (+)6 (-)3
% [3] big_j_2 (+)8 (-)2
% ------------------
% Total: (+)22 (-)13
% Total number of unit clauses retained: 35
% Number of clauses skipped because of their length: 15878125
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 288
% Number of successful unifications: 15473206
% Number of unification failures: 49019851
% Number of unit to unit unification failures: 29
% N literal unification failure due to lookup root_id table: 26160662
% N base clause resolution failure due to lookup table: 415
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 7
% N unit clauses dropped because they exceeded max values: 2507744
% N unit clauses dropped because too much nesting: 34992
% 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: 7
% Max term depth in a unit clause: 4
% Number of states in UCFA table: 42
% Total number of terms of all unit clauses in table: 111
% 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.38
% Number of symbols (columns) in UCFA: 41
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 64493057
% ConstructUnitClause() = 2507777
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 2.47 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 499135
% | |
% --------------------------------------------------------
% Elapsed time: 32 secs
% CPU time: 31.02 secs
%
%------------------------------------------------------------------------------