TSTP Solution File: SET830-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SET830-2 : TPTP v5.0.0. Released v3.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art04.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 05:46:17 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/SystemOnTPTP9510/SET/SET830-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 = 26] [nf = 0] [nu = 8] [ut = 5]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 308] [nf = 15] [nu = 144] [ut = 20]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 4707] [nf = 145] [nu = 2070] [ut = 34]
% Looking for a proof at depth = 4 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: c_in_3(v_x_0(),v_Y_0(),t_a_0())
% B2: ~c_in_3(v_x_0(),v_X_0(),t_a_0())
% B4: ~c_in_3(x0,c_inter_3(x1,x2,x3),x3) | c_in_3(x0,x1,x3)
% B5: ~c_in_3(x0,c_inter_3(x1,x2,x3),x3) | c_in_3(x0,x2,x3)
% B6: c_in_3(c_Main_OsubsetI__1_3(x0,x1,x2),x0,x2) | c_lessequals_3(x0,x1,tc_set_1(x2))
% B8: ~c_in_3(x0,x1,x2) | ~c_lessequals_3(x1,x3,tc_set_1(x2)) | c_in_3(x0,x3,x2)
% B9: ~c_in_3(x0,x3,x2) | ~c_in_3(x0,x1,x2) | c_in_3(x0,c_inter_3(x3,x1,x2),x2)
% Unit Clauses:
% --------------
% U1: < d0 v0 dv0 f0 c3 t3 td1 b nc > c_in_3(v_x_0(),v_Z_0(),t_a_0())
% U9: < d2 v0 dv0 f1 c5 t6 td2 > c_in_3(v_x_0(),c_inter_3(v_Y_0(),v_Z_0(),t_a_0()),t_a_0())
% U28: < d3 v5 dv3 f2 c0 t7 td2 > c_lessequals_3(c_inter_3(x0,x1,x2),x0,tc_set_1(x2))
% U31: < d3 v5 dv3 f2 c0 t7 td2 > c_lessequals_3(c_inter_3(x0,x1,x2),x1,tc_set_1(x2))
% U37: < d4 v0 dv0 f2 c5 t7 td2 > ~c_lessequals_3(c_inter_3(v_Y_0(),v_Z_0(),t_a_0()),v_Z_0(),tc_set_1(t_a_0()))
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% c_in_3(v_x_0(),v_Z_0(),t_a_0()) ....... U1
% Derivation of unit clause U9:
% c_in_3(v_x_0(),v_Y_0(),t_a_0()) ....... B0
% ~c_in_3(x0,x3,x2) | ~c_in_3(x0,x1,x2) | c_in_3(x0,c_inter_3(x3,x1,x2),x2) ....... B9
% ~c_in_3(v_x_0(), x0, t_a_0()) | c_in_3(v_x_0(), c_inter_3(v_Y_0(), x0, t_a_0()), t_a_0()) ....... R1 [B0:L0, B9:L0]
% c_in_3(v_x_0(),v_Z_0(),t_a_0()) ....... U1
% c_in_3(v_x_0(), c_inter_3(v_Y_0(), v_Z_0(), t_a_0()), t_a_0()) ....... R2 [R1:L0, U1:L0]
% Derivation of unit clause U28:
% ~c_in_3(x0,c_inter_3(x1,x2,x3),x3) | c_in_3(x0,x1,x3) ....... B4
% c_in_3(c_Main_OsubsetI__1_3(x0,x1,x2),x0,x2) | c_lessequals_3(x0,x1,tc_set_1(x2)) ....... B6
% c_in_3(c_Main_OsubsetI__1_3(c_inter_3(x0, x1, x2), x3, x2), x0, x2) | c_lessequals_3(c_inter_3(x0, x1, x2), x3, tc_set_1(x2)) ....... R1 [B4:L0, B6:L0]
% ~c_in_3(c_Main_OsubsetI__1_3(x0,x1,x2),x1,x2) | c_lessequals_3(x0,x1,tc_set_1(x2)) ....... B7
% c_lessequals_3(c_inter_3(x0, x1, x2), x0, tc_set_1(x2)) | c_lessequals_3(c_inter_3(x0, x1, x2), x0, tc_set_1(x2)) ....... R2 [R1:L0, B7:L0]
% c_lessequals_3(c_inter_3(x0, x1, x2), x0, tc_set_1(x2)) ....... R3 [R2:L0, R2:L1]
% Derivation of unit clause U31:
% ~c_in_3(x0,c_inter_3(x1,x2,x3),x3) | c_in_3(x0,x2,x3) ....... B5
% c_in_3(c_Main_OsubsetI__1_3(x0,x1,x2),x0,x2) | c_lessequals_3(x0,x1,tc_set_1(x2)) ....... B6
% c_in_3(c_Main_OsubsetI__1_3(c_inter_3(x0, x1, x2), x3, x2), x1, x2) | c_lessequals_3(c_inter_3(x0, x1, x2), x3, tc_set_1(x2)) ....... R1 [B5:L0, B6:L0]
% ~c_in_3(c_Main_OsubsetI__1_3(x0,x1,x2),x1,x2) | c_lessequals_3(x0,x1,tc_set_1(x2)) ....... B7
% c_lessequals_3(c_inter_3(x0, x1, x2), x1, tc_set_1(x2)) | c_lessequals_3(c_inter_3(x0, x1, x2), x1, tc_set_1(x2)) ....... R2 [R1:L0, B7:L0]
% c_lessequals_3(c_inter_3(x0, x1, x2), x1, tc_set_1(x2)) ....... R3 [R2:L0, R2:L1]
% Derivation of unit clause U37:
% ~c_in_3(v_x_0(),v_X_0(),t_a_0()) ....... B2
% ~c_in_3(x0,x1,x2) | ~c_lessequals_3(x1,x3,tc_set_1(x2)) | c_in_3(x0,x3,x2) ....... B8
% ~c_in_3(v_x_0(), x0, t_a_0()) | ~c_lessequals_3(x0, v_X_0(), tc_set_1(t_a_0())) ....... R1 [B2:L0, B8:L2]
% ~c_lessequals_3(x0,v_Y_0(),tc_set_1(t_a_0())) | ~c_lessequals_3(x0,v_Z_0(),tc_set_1(t_a_0())) | c_lessequals_3(x0,v_X_0(),tc_set_1(t_a_0())) ....... B3
% ~c_in_3(v_x_0(), x0, t_a_0()) | ~c_lessequals_3(x0, v_Y_0(), tc_set_1(t_a_0())) | ~c_lessequals_3(x0, v_Z_0(), tc_set_1(t_a_0())) ....... R2 [R1:L1, B3:L2]
% c_in_3(v_x_0(),c_inter_3(v_Y_0(),v_Z_0(),t_a_0()),t_a_0()) ....... U9
% ~c_lessequals_3(c_inter_3(v_Y_0(), v_Z_0(), t_a_0()), v_Y_0(), tc_set_1(t_a_0())) | ~c_lessequals_3(c_inter_3(v_Y_0(), v_Z_0(), t_a_0()), v_Z_0(), tc_set_1(t_a_0())) ....... R3 [R2:L0, U9:L0]
% c_lessequals_3(c_inter_3(x0,x1,x2),x0,tc_set_1(x2)) ....... U28
% ~c_lessequals_3(c_inter_3(v_Y_0(), v_Z_0(), t_a_0()), v_Z_0(), tc_set_1(t_a_0())) ....... R4 [R3:L0, U28:L0]
% Derivation of the empty clause:
% ~c_lessequals_3(c_inter_3(v_Y_0(),v_Z_0(),t_a_0()),v_Z_0(),tc_set_1(t_a_0())) ....... U37
% c_lessequals_3(c_inter_3(x0,x1,x2),x1,tc_set_1(x2)) ....... U31
% [] ....... R1 [U37:L0, U31:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 9484
% resolvents: 9201 factors: 283
% Number of unit clauses generated: 4308
% % unit clauses generated to total clauses generated: 45.42
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 3 [1] = 2 [2] = 15 [3] = 14
% [4] = 4
% Total = 38
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 4308 [2] = 4576 [3] = 600
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c_in_3 (+)10 (-)7
% [1] c_lessequals_3 (+)3 (-)18
% ------------------
% Total: (+)13 (-)25
% Total number of unit clauses retained: 38
% Number of clauses skipped because of their length: 3093
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 9496
% Number of unification failures: 10439
% Number of unit to unit unification failures: 123
% N literal unification failure due to lookup root_id table: 11281
% N base clause resolution failure due to lookup table: 370
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 13
% N unit clauses dropped because they exceeded max values: 3874
% N unit clauses dropped because too much nesting: 48
% 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: 2
% Number of states in UCFA table: 136
% Total number of terms of all unit clauses in table: 225
% 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.60
% Number of symbols (columns) in UCFA: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 19935
% ConstructUnitClause() = 3909
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.01 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.16 secs
%
%------------------------------------------------------------------------------