%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SYN350-1 : TPTP v5.0.0. Released v1.2.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art02.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:58:37 EST 2010 % Result : Unsatisfiable 0.14s % Output : Refutation 0.14s % 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/SystemOnTPTP4797/SYN/SYN350-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 = 2] [nf = 0] [nu = 0] [ut = 0] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 42] [nf = 20] [nu = 0] [ut = 0] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 295] [nf = 126] [nu = 0] [ut = 0] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 1799] [nf = 398] [nu = 122] [ut = 3] % Looking for a proof at depth = 5 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~f_2(a_0(),z_2(x0,x1)) | f_2(z_2(x0,x1),a_0()) % B1: ~f_2(z_2(x0,x1),a_0()) | f_2(a_0(),z_2(x0,x1)) % B4: f_2(a_0(),z_2(x0,x1)) | f_2(x1,z_2(x0,x1)) | f_2(x0,z_2(x0,x1)) % B5: ~f_2(x0,x1) | ~f_2(x1,z_2(x0,x1)) | ~f_2(a_0(),z_2(x0,x1)) % Unit Clauses: % -------------- % U0: < d4 v0 dv0 f1 c3 t4 td2 > f_2(a_0(),z_2(a_0(),a_0())) % U1: < d4 v0 dv0 f2 c4 t6 td3 > ~f_2(z_2(z_2(a_0(),a_0()),a_0()),a_0()) % U3: < d5 v0 dv0 f2 c4 t6 td3 > ~f_2(a_0(),z_2(z_2(a_0(),a_0()),a_0())) % U4: < d5 v0 dv0 f1 c3 t4 td2 > f_2(z_2(a_0(),a_0()),a_0()) % U5: < d5 v0 dv0 f2 c4 t6 td3 > f_2(a_0(),z_2(z_2(a_0(),a_0()),a_0())) % --------------- Start of Proof --------------- % Derivation of unit clause U0: % ~f_2(a_0(),z_2(x0,x1)) | f_2(z_2(x0,x1),a_0()) ....... B0 % f_2(a_0(),z_2(x0,x1)) | f_2(x1,z_2(x0,x1)) | f_2(x0,z_2(x0,x1)) ....... B4 % f_2(z_2(x0, x1), a_0()) | f_2(x1, z_2(x0, x1)) | f_2(x0, z_2(x0, x1)) ....... R1 [B0:L0, B4:L0] % f_2(z_2(x0, x0), a_0()) | f_2(x0, z_2(x0, x0)) ....... R2 [R1:L2, R1:L1] % ~f_2(z_2(x0,x1),a_0()) | f_2(a_0(),z_2(x0,x1)) ....... B1 % f_2(x0, z_2(x0, x0)) | f_2(a_0(), z_2(x0, x0)) ....... R3 [R2:L0, B1:L0] % f_2(a_0(), z_2(a_0(), a_0())) ....... R4 [R3:L0, R3:L1] % Derivation of unit clause U1: % ~f_2(a_0(),z_2(x0,x1)) | f_2(z_2(x0,x1),a_0()) ....... B0 % ~f_2(x0,x1) | ~f_2(x1,z_2(x0,x1)) | ~f_2(a_0(),z_2(x0,x1)) ....... B5 % ~f_2(a_0(), z_2(x0, x1)) | ~f_2(a_0(), z_2(z_2(x0, x1), a_0())) | ~f_2(a_0(), z_2(z_2(x0, x1), a_0())) ....... R1 [B0:L1, B5:L0] % ~f_2(a_0(), z_2(x0, x1)) | ~f_2(a_0(), z_2(z_2(x0, x1), a_0())) ....... R2 [R1:L2, R1:L1] % ~f_2(z_2(x0,x1),a_0()) | f_2(a_0(),z_2(x0,x1)) ....... B1 % ~f_2(a_0(), z_2(x0, x1)) | ~f_2(z_2(z_2(x0, x1), a_0()), a_0()) ....... R3 [R2:L1, B1:L1] % f_2(a_0(),z_2(a_0(),a_0())) ....... U0 % ~f_2(z_2(z_2(a_0(), a_0()), a_0()), a_0()) ....... R4 [R3:L0, U0:L0] % Derivation of unit clause U3: % ~f_2(a_0(),z_2(x0,x1)) | f_2(z_2(x0,x1),a_0()) ....... B0 % ~f_2(z_2(x0,x1),a_0()) | f_2(a_0(),z_2(x0,x1)) ....... B1 % ~f_2(a_0(), z_2(x0, x1)) | f_2(a_0(), z_2(x0, x1)) ....... R1 [B0:L1, B1:L0] % ~f_2(a_0(),z_2(x0,x1)) | f_2(z_2(x0,x1),a_0()) ....... B0 % ~f_2(a_0(), z_2(x0, x1)) | f_2(z_2(x0, x1), a_0()) ....... R2 [R1:L1, B0:L0] % ~f_2(z_2(x0,x1),a_0()) | f_2(a_0(),z_2(x0,x1)) ....... B1 % f_2(z_2(x0, x1), a_0()) | ~f_2(z_2(x0, x1), a_0()) ....... R3 [R2:L0, B1:L1] % ~f_2(a_0(),z_2(x0,x1)) | f_2(z_2(x0,x1),a_0()) ....... B0 % f_2(z_2(x0, x1), a_0()) | ~f_2(a_0(), z_2(x0, x1)) ....... R4 [R3:L1, B0:L1] % ~f_2(z_2(z_2(a_0(),a_0()),a_0()),a_0()) ....... U1 % ~f_2(a_0(), z_2(z_2(a_0(), a_0()), a_0())) ....... R5 [R4:L0, U1:L0] % Derivation of unit clause U4: % ~f_2(a_0(),z_2(x0,x1)) | f_2(z_2(x0,x1),a_0()) ....... B0 % ~f_2(z_2(x0,x1),a_0()) | f_2(a_0(),z_2(x0,x1)) ....... B1 % ~f_2(a_0(), z_2(x0, x1)) | f_2(a_0(), z_2(x0, x1)) ....... R1 [B0:L1, B1:L0] % ~f_2(a_0(),z_2(x0,x1)) | f_2(z_2(x0,x1),a_0()) ....... B0 % ~f_2(a_0(), z_2(x0, x1)) | f_2(z_2(x0, x1), a_0()) ....... R2 [R1:L1, B0:L0] % ~f_2(z_2(x0,x1),a_0()) | f_2(a_0(),z_2(x0,x1)) ....... B1 % f_2(z_2(x0, x1), a_0()) | ~f_2(z_2(x0, x1), a_0()) ....... R3 [R2:L0, B1:L1] % ~f_2(a_0(),z_2(x0,x1)) | f_2(z_2(x0,x1),a_0()) ....... B0 % f_2(z_2(x0, x1), a_0()) | ~f_2(a_0(), z_2(x0, x1)) ....... R4 [R3:L1, B0:L1] % f_2(a_0(),z_2(a_0(),a_0())) ....... U0 % f_2(z_2(a_0(), a_0()), a_0()) ....... R5 [R4:L1, U0:L0] % Derivation of unit clause U5: % ~f_2(a_0(),z_2(x0,x1)) | f_2(z_2(x0,x1),a_0()) ....... B0 % ~f_2(z_2(x0,x1),a_0()) | f_2(a_0(),z_2(x0,x1)) ....... B1 % ~f_2(a_0(), z_2(x0, x1)) | f_2(a_0(), z_2(x0, x1)) ....... R1 [B0:L1, B1:L0] % ~f_2(a_0(),z_2(x0,x1)) | f_2(z_2(x0,x1),a_0()) ....... B0 % ~f_2(a_0(), z_2(x0, x1)) | f_2(z_2(x0, x1), a_0()) ....... R2 [R1:L1, B0:L0] % ~f_2(x0,x1) | f_2(a_0(),z_2(x0,x1)) | f_2(x1,z_2(x0,x1)) ....... B2 % f_2(z_2(x0, x1), a_0()) | ~f_2(x0, x1) | f_2(x1, z_2(x0, x1)) ....... R3 [R2:L0, B2:L1] % ~f_2(z_2(z_2(a_0(),a_0()),a_0()),a_0()) ....... U1 % ~f_2(z_2(a_0(), a_0()), a_0()) | f_2(a_0(), z_2(z_2(a_0(), a_0()), a_0())) ....... R4 [R3:L0, U1:L0] % f_2(z_2(a_0(),a_0()),a_0()) ....... U4 % f_2(a_0(), z_2(z_2(a_0(), a_0()), a_0())) ....... R5 [R4:L0, U4:L0] % Derivation of the empty clause: % f_2(a_0(),z_2(z_2(a_0(),a_0()),a_0())) ....... U5 % ~f_2(a_0(),z_2(z_2(a_0(),a_0()),a_0())) ....... U3 % [] ....... R1 [U5:L0, U3:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 2260 % resolvents: 1848 factors: 412 % Number of unit clauses generated: 139 % % unit clauses generated to total clauses generated: 6.15 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [4] = 3 [5] = 3 % Total = 6 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 139 [2] = 1211 [3] = 910 % Average size of a generated clause: 3.0 % Number of unit clauses per predicate list: % ========================================== % [0] f_2 (+)3 (-)3 % ------------------ % Total: (+)3 (-)3 % Total number of unit clauses retained: 6 % Number of clauses skipped because of their length: 2005 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 178 % Number of successful unifications: 2283 % Number of unification failures: 1608 % Number of unit to unit unification failures: 8 % N literal unification failure due to lookup root_id table: 3476 % N base clause resolution failure due to lookup table: 568 % 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: 113 % 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: 3 % Number of states in UCFA table: 24 % Total number of terms of all unit clauses in table: 28 % 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.86 % Number of symbols (columns) in UCFA: 37 % Profile 2: Number of calls to: % ============================== % PTUnify() = 3891 % ConstructUnitClause() = 119 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.14 secs % %------------------------------------------------------------------------------